Rate-Preserving Discretization Strategies for Semi-Infinite Programming and Optimal Control

DOI10.1137/0330032zbMath0790.49027OpenAlexW2178744658MaRDI QIDQ4016751

Elijah Polak, Limin He

Publication date: 16 January 1993

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0330032

zbMATH Keywords

discretizationunconstrained optimal controlconstrained semi-infinite problemsunconstrained semi-infinite minimax problems

Mathematics Subject Classification ID

Semi-infinite programming (90C34) Existence theories for optimal control problems involving ordinary differential equations (49J15) Optimality conditions for minimax problems (49K35) Numerical approximation and computational geometry (primarily algorithms) (65D99)

Related Items

Multistart method with estimation scheme for global satisfycing problems ⋮ Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems ⋮ Nonlinear set membership filter with state estimation constraints via consensus-ADMM ⋮ The stability of the maximum entropy method for nonsmooth semi-infinite programmings ⋮ Preface ⋮ Path-following proximal approach for solving ill-posed convex semi-infinite programming problems ⋮ On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems

This page was built for publication: Rate-Preserving Discretization Strategies for Semi-Infinite Programming and Optimal Control