A dual parameterization approach to linear-quadratic semi-infinite programming problems

DOI10.1080/10556789908805725zbMath0919.90138MaRDI QIDQ4242974

Yanqun Liu, Satoshi Ito, Kok Lay Teo

Publication date: 5 September 1999

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556789908805725

zbMATH Keywords

duality; convergence results; linear-quadratic semi-infinite programming

Mathematics Subject Classification ID

90C34: Semi-infinite programming

Related Items

Semi-infinite programming approach to continuously-constrained linear-quadratic optimal control problems, Some properties on quadratic infinite programs of integral type, A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming, An approximation approach to non-strictly convex quadratic semi-infinite programming, Linear semi-infinite programming theory: an updated survey, Semi-infinite programming approach to nonlinear time-delayed optimal control problems with linear continuous constraints

Uses Software

• Optimization Toolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A computational algorithm for functional inequality constrained optimization problems
• Infinitely constrained optimization problems
• A new computational algorithm for functional inequality constrained optimization problems
• Semi-Infinite Programming: Theory, Methods, and Applications
• A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design
• An improved algorithm for optimization problems with functional inequality constraints
• A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
• Numerical treatment of a class of semi‐infinite programming problems