385 citations
- Newcastle UniversityGB60 papers
- Australian National UniversityAU25 papers
- The University of SydneyAU22 papers
- UNSW SydneyAU21 papers
- Commonwealth Scientific and Industrial Research OrganisationAU19 papers
- The University of MelbourneAU17 papers
- Center for Astrophysics Harvard & SmithsonianUS16 papers
- The University of QueenslandAU16 papers
- Uppsala UniversitySE16 papers
- National Astronomical Observatory of JapanJP15 papers
- Centre National de la Recherche ScientifiqueFR14 papers
- Max Planck Institute for AstronomyDE13 papers
42 papers · 1 filter
Achieving distributed convex optimization within prescribed time for high-order nonlinear multiagent systems
Gewei Zuo, Lijun Zhu, Yujuan Wang +2
In this paper, we address the distributed prescribed-time convex optimization (DPTCO) problem for a class of nonlinear multi-agent systems (MASs) under undirected connected graph.…
Data to Controller for Nonlinear Systems: An Approximate Solution
Johannes N. Hendriks, James R. Z. Holdsworth, Adrian G. Wills +2
This paper considers the problem of determining an optimal control action based on observed data. We formulate the problem assuming that the system can be modelled by a nonlinear s…
Distributed Newton Optimization with Maximized Convergence Rate
Damián Marelli, Yong Xu, Minyue Fu +1
The distributed optimization problem is set up in a collection of nodes interconnected via a communication network. The goal is to find the minimizer of a global objective function…
Surprise Maximization: A Dynamic Programming Approach
Ali Eshragh
Borwein et al. (2000) solved a surprise maximization problem by applying results from convex analysis and mathematical programming. Although, their proof is elegant, it requires ad…
Constraint reduction reformulations for projection algorithms with applications to wavelet construction
Minh Dao, Neil Dizon, Jeffrey Hogan +1
We introduce a reformulation technique that converts a many-set feasibility problem into an equivalent two-set problem. This technique involves reformulating the original feasibili…
An analytical bound on the fleet size in vehicle routing problems: a dynamic programming approach
Ali Eshragh, Rasul Esmaeilbeigi, Richard Middleton
We present an analytical upper bound on the number of required vehicles for vehicle routing problems with split deliveries and any number of capacitated depots. We show that a flee…