A local search scheme for the inequality-constrained optimal control problem
From MaRDI portal
Publication:2117613
DOI10.1007/978-3-030-77876-7_2zbMath1492.49012OpenAlexW3171305160MaRDI QIDQ2117613
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-77876-7_2
linearized problemexact penaltynonconvex optimal controllocal search schemestate-convex functionsstate-DC functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On global search in nonconvex optimal control problems
- On local search in d.c. optimization problems
- Dynamics and control of trajectory tubes. Theory and computation
- Maximizing a state convex Lagrange functional in optimal control
- Control of nonlinear dynamical systems. Methods and applications
- A local search method for optimization problem with d.c. inequality constraints
- Global optimality conditions in nonconvex optimization
- Global optimality conditions and exact penalization
- Global optimality conditions for optimal control problems with functions of A.D. Alexandrov
- A unifying theory of exactness of linear penalty functions
- On Solving Optimization Problems with Hidden Nonconvex Structures
- An Exact Penalization Viewpoint of Constrained Optimization
- Exact penalty functions for optimal control problems I: Main theorem and free‐endpoint problems
- Exact Penalty Property in Optimization with Mixed Constraints via Variational Analysis
- Newton-Type Methods for Optimization and Variational Problems
- Non-Linear Programming Via Penalty Functions
- Global search in the optimal control problem with a terminal objective functional represented as the difference of two convex functions
