A note on an implementation of a method for quadratic semi-infinite programming

DOI10.1007/BF01585742zbMath0699.90078OpenAlexW2086067311MaRDI QIDQ913660

N. E. Zubov

Publication date: 1990

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01585742

zbMATH Keywords

convex quadratic semi-infinite optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20) Semi-infinite programming (90C34)

Related Items

Some outer approximation methods for semi-infinite optimization problems, Monotone Smoothing Splines using General Linear Systems, A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems, A modified exchange algorithm for distributional robust optimization and applications in risk management, Global convergence of a class of smooth penalty methods for semi-infinite programming, Robot trajectory planning with semi-infinite programming., On the numerical treatment of linearly constrained semi-infinite optimization problems, A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming, A quasi-Newton interior point method for semi-infinite programming, A semi-infinite programming method for approximating load duration curves by polynomials, Air pollution control with semi-infinite programming, Discretization method for semi-definite programming, A new proof of the strong duality theorem for semidefinite programming

Uses Software

• ZQPCVX

Cites Work

• Unnamed Item
• On the quadratic programming algorithm of Goldfarb and Idnani
• An implementation of a discretization method for semi-infinite programming