Optimization over the Pareto front of nonconvex multi-objective optimal control problems
From MaRDI portal
Abstract: Simultaneous optimization of multiple objective functions results in a set of trade-off, or Pareto, solutions. Choosing a, in some sense, best solution in this set is in general a challenging task: In the case of three or more objectives the Pareto front is usually difficult to view, if not impossible, and even in the case of just two objectives constructing the whole Pareto front so as to visually inspect it might be very costly. Therefore, optimization over the Pareto (or efficient) set has been an active area of research. Although there is a wealth of literature involving finite dimensional optimization problems in this area, there is a lack of problem formulation and numerical methods for optimal control problems, except for the convex case. In this paper, we formulate the problem of optimizing over the Pareto front of nonconvex constrained and time-delayed optimal control problems as a bi-level optimization problem. Motivated by existing solution differentiability results, we propose an algorithm incorporating (i) the Chebyshev scalarization, (ii) a concept of the essential interval of weights, and (iii) the simple but effective bisection method, for optimal control problems with two objectives. We illustrate the working of the algorithm on two example problems involving an electric circuit and treatment of tuberculosis and discuss future lines of research for new computational methods.
Recommendations
- A numerical method for nonconvex multi-objective optimal control problems
- Multi-objective infinite horizon optimal control problems: characterization of the Pareto fronts and Pareto solutions
- Pareto front characterization for multiobjective optimal control problems using Hamilton-Jacobi approach
- Fast Pareto set generation for nonlinear optimal control problems with multiple objectives
- Efficient scalarization in multiobjective optimal control of a nonsmooth PDE
Cites work
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- A Modeling Language for Mathematical Programming
- A new scalarization and numerical method for constructing the weak Pareto front of multi-objective optimization problems
- A new scalarization technique and new algorithms to generate Pareto fronts
- A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
- A numerical method for nonconvex multi-objective optimal control problems
- Adaptive Scalarization Methods in Multiobjective Optimization
- Algorithms for the vector maximization problem
- Applications to regular and bang-bang control. Second-order necessary and sufficient optimality conditions in calculus of variations and optimal control
- Approximations of linear control problems with bang-bang solutions
- Error bounds for euler approximation of a state and control constrained optimal control problem1
- Fast Pareto set generation for nonlinear optimal control problems with multiple objectives
- High order discrete approximations to Mayer's problems for linear systems
- scientific article; zbMATH DE number 1173712 (Why is no real title available?)
- Lipschitzian Stability in Nonlinear Control and Optimization
- Maximizing a concave function over the efficient or weakly-efficient set
- Minimization of a quasi-concave function over an efficient set
- Multi-objective infinite horizon optimal control problems: characterization of the Pareto fronts and Pareto solutions
- Nonlinear multiobjective optimization
- On optimization over the efficient set in linear multicriteria programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Optimal control of a tuberculosis model with state and control delays
- Optimality conditions for minimization over the (weakly or properly) efficient set
- Optimization over the efficient set
- Optimization over the efficient set
- Optimization over the efficient set of multi-objective convex optimal control problems
- Optimization over the efficient set using an active constraint approach
- Optimization over the efficient set: overview
- Pareto front characterization for multiobjective optimal control problems using Hamilton-Jacobi approach
- Practical methods for optimal control using nonlinear programming
- Primal and dual algorithms for optimization over the efficient set
- Second Order Sufficient Conditions for Optimal Control Problems with Free Final Time: The Riccati Approach
- Second-Order Runge--Kutta Approximations in Control Constrained Optimal Control
- Sensitivity analysis for parametric control problems with control-state constraints
- Sensitivity analysis for state constrained optimal control problems
- Solution Differentiability for Nonlinear Parametric Control Problems
- Solution differentiability for parametric nonlinear control problems with control-state constraints
- SQP-methods for solving optimal control problems with control and state constraints: Adjoint variables, sensitivity analysis and real-time control
- State constrained optimal control problems with time delays
- The Euler approximation in state constrained optimal control
- Theory and applications of optimal control problems with multiple time-delays
- Vector Optimization
Cited in
(3)
This page was built for publication: Optimization over the Pareto front of nonconvex multi-objective optimal control problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6188054)
