On Nesterov's approach to semi-infinite programming

DOI10.1023/A:1020643711475zbMath1027.90098OpenAlexW168152063MaRDI QIDQ1862263

Leonid Faybusovich

Publication date: 11 March 2003

Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1020643711475

zbMATH Keywords

interior-point algorithmssemidefinite programmingsemi-infinite programmingmoment problemsnonnegative polynomials

Mathematics Subject Classification ID

Semidefinite programming (90C22) Interior-point methods (90C51) Semi-infinite programming (90C34)

Related Items

Strong duality and minimal representations for cone optimization, Automorphisms of Rank-One Generated Hyperbolicity Cones and Their Derivative Relaxations, Linear optimization over homogeneous matrix cones, Existence and uniqueness of solutions for homogeneous cone complementarity problems, Bad Semidefinite Programs: They All Look the Same, Amenable cones: error bounds without constraint qualifications, On hyperbolicity cones associated with elementary symmetric polynomials, Invariance and efficiency of convex representations, The Lax conjecture is true, Numerical experiments with universal barrier functions for cones of Chebyshev systems, Semidefinite descriptions of cones defining spectral mask constraints, Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization, Amenable Cones Are Particularly Nice

Uses Software

• CRYPTIM