Local optimization of dynamic programs with guaranteed satisfaction of path constraints
From MaRDI portal
Recommendations
- Constraint-based local search for constrained optimum paths problems
- Local minimization algorithms for dynamic programming equations
- Local dynamic programming incuts in routing problems with restrictions
- A constraint programming framework for local search methods
- Local Search and Constraint Programming
- Local search in problems with nonconvex constraints
- scientific article; zbMATH DE number 2084730
- On Finding and Verifying Locally Optimal Solutions
- scientific article; zbMATH DE number 5785700
Cites work
- scientific article; zbMATH DE number 1186929 (Why is no real title available?)
- scientific article; zbMATH DE number 50941 (Why is no real title available?)
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 589257 (Why is no real title available?)
- scientific article; zbMATH DE number 3109695 (Why is no real title available?)
- scientific article; zbMATH DE number 7485204 (Why is no real title available?)
- A dynamic programming approach to trajectory planning of robotic manipulators
- A feasible point adaptation of the Blankenship and Falk algorithm for semi-infinite programming
- A minima tracking variant of semi-infinite programming for the treatment of path constraints within direct solution of optimal control problems
- A new computational algorithm for functional inequality constrained optimization problems
- Adjoint Sensitivity Analysis for Differential-Algebraic Equations: The Adjoint DAE System and Its Numerical Solution
- An exact penalty function method for continuous inequality constrained optimal control problem
- Application of sparse nonlinear programming to trajectory optimization
- Control parameterization for optimal control problems with continuous inequality constraints: New convergence results
- Control parametrization: a unified approach to optimal control problems with general constraints
- Global optimization of generalized semi-infinite programs via restriction of the right hand side
- Global optimization of semi-infinite programs via restriction of the right-hand side
- Global optimization with nonlinear ordinary differential equations
- Handbook of test problems in local and global optimization
- Infinitely constrained optimization problems
- Introduction to the Theory of Nonlinear Optimization
- Modeling, simulation, sensitivity analysis, and optimization of hybrid systems
- Nonlinear Programming
- Optimal Control of Underactuated Nonholonomic Mechanical Systems
- Optimal control of the Shuttle-Tethered-Subsatellite system
- Optimal control problems with a continuous inequality constraint on the state and the control
- Optimal control via collocation and non-linear programming
- Relaxation-Based Bounds for Semi-Infinite Programs
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Semi-Infinite Programming: Theory, Methods, and Applications
- Sensitivity analysis of linearly-implicit differential--algebraic systems by one-step extrapolation.
- State event location in differential-algebraic models
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- The \(\alpha\)-method direct transcription in path constrained dynamic optimization
- The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
- The control parameterization method for nonlinear optimal control: a survey
- Variational analysis in semi-infinite and infinite programming. II: Necessary optimality conditions
- Wavelet collocation method for optimal control problems
Cited in
(12)- Time optimal control of triple integrator with input saturation and full state constraints
- A mathematical model and two-stage heuristic for hot rolling scheduling in compact strip production
- Adjoint-based SQP method with block-wise quasi-Newton Jacobian updates for nonlinear optimal control
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- Dynamic optimization of nonlinear systems with guaranteed feasibility of inequality-path-constraints
- Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
- Output feedback passification of saturated switched systems under the improved state-dependent switching
- Guaranteed satisfaction of inequality state constraints in PDE-constrained optimization
- Dynamic optimization of state-dependent switched systems with free switching sequences
- Multi-objective dynamic optimization of path-constrained switched systems
- scientific article; zbMATH DE number 2087632 (Why is no real title available?)
- Solving chiller loading optimization problems using an improved teaching-learning-based optimization algorithm
This page was built for publication: Local optimization of dynamic programs with guaranteed satisfaction of path constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q901119)
