A solution method for combined semi-infinite and semi-definite programming
From MaRDI portal
Publication:4831772
DOI10.1017/S1446181100013511zbMath1176.90452OpenAlexW2139298878MaRDI QIDQ4831772
Soon-Yi Wu, Xiao Qi Yang, Sheng Jie Li, Kok Lay Teo
Publication date: 3 January 2005
Published in: The ANZIAM Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1446181100013511
Semidefinite programming (90C22) Approximation methods and heuristics in mathematical programming (90C59) Interior-point methods (90C51) Semi-infinite programming (90C34)
Related Items (3)
Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints ⋮ An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs ⋮ A relaxed cutting plane method for semi-infinite semi-definite programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inequality systems and optimization
- Quadratic programming with one negative eigenvalue is NP-hard
- Zero duality gaps in infinite-dimensional programming
- Some outer approximation methods for semi-infinite optimization problems
- Optimization. Algorithms and consistent approximations
- Conditioning of semidefinite programs
- An extension of the simplex algorithm for semi-infinite linear programming
- Relaxed cutting plane method for solving linear semi-infinite programming problems
- Proximal interior point method for convex semi-infinite programming
- An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semidefinite optimization
- A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
- Strong Duality for Semidefinite Programming
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Semidefinite Programming
- An Interior-Point Method for Semidefinite Programming
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Computational discretization algorithms for functional inequality constrained optimization
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
- Nonlinear Lagrangian functions and applications to semi-infinite programs
This page was built for publication: A solution method for combined semi-infinite and semi-definite programming