A local search scheme for the inequality-constrained optimal control problem
From MaRDI portal
Publication:2117613
Recommendations
- A local search method for optimization problem with d.c. inequality constraints
- Computational Study of Local Search Methods for a D.C. Optimization Problem with Inequality Constraints
- Global search in a noncovex optimal control problem
- On global search in nonconvex optimal control problems
- Optimal control problems with a continuous inequality constraint on the state and the control
Cites work
- scientific article; zbMATH DE number 992243 (Why is no real title available?)
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3167339 (Why is no real title available?)
- scientific article; zbMATH DE number 3950216 (Why is no real title available?)
- scientific article; zbMATH DE number 3722491 (Why is no real title available?)
- scientific article; zbMATH DE number 3723370 (Why is no real title available?)
- scientific article; zbMATH DE number 3777196 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 3249572 (Why is no real title available?)
- A local search method for optimization problem with d.c. inequality constraints
- A unifying theory of exactness of linear penalty functions
- An Exact Penalization Viewpoint of Constrained Optimization
- Control of nonlinear dynamical systems. Methods and applications
- Dynamics and control of trajectory tubes. Theory and computation
- 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
- Global optimality conditions and exact penalization
- Global optimality conditions for optimal control problems with functions of A.D. Alexandrov
- Global optimality conditions in nonconvex optimization
- Global search in the optimal control problem with a terminal objective functional represented as the difference of two convex functions
- Maximizing a state convex Lagrange functional in optimal control
- Newton-Type Methods for Optimization and Variational Problems
- Non-Linear Programming Via Penalty Functions
- On global search in nonconvex optimal control problems
- On local search in d.c. optimization problems
- On solving optimization problems with hidden nonconvex structures
This page was built for publication: A local search scheme for the inequality-constrained optimal control problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117613)