A solution method for combined semi-infinite and semi-definite programming
From MaRDI portal
Publication:4831772
Recommendations
- A relaxed cutting plane method for semi-infinite semi-definite programming
- Discretization methods for the solution of semi-infinite programming problems
- Solving semidefinite programs via discretization method for solving semiinfinite programming problems
- An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence
- scientific article; zbMATH DE number 4001882
Cites work
- A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
- An extension of the simplex algorithm for semi-infinite linear programming
- An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices
- An Interior-Point Method for Semidefinite Programming
- Computational discretization algorithms for functional inequality constrained optimization
- Conditioning of semidefinite programs
- Handbook of semidefinite programming. Theory, algorithms, and applications
- scientific article; zbMATH DE number 3145485 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- Inequality systems and optimization
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Nonlinear Lagrangian functions and applications to semi-infinite programs
- Optimization. Algorithms and consistent approximations
- Proximal interior point method for convex semi-infinite programming
- Quadratic programming with one negative eigenvalue is NP-hard
- Relaxed cutting plane method for solving linear semi-infinite programming problems
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semidefinite optimization
- Semidefinite Programming
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
- Some outer approximation methods for semi-infinite optimization problems
- Strong Duality for Semidefinite Programming
- Zero duality gaps in infinite-dimensional programming
Cited in
(8)- The regularized constraint aggregation method for a problem of semi-infinite optimization
- An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs
- Robust envelope-constrained filter with orthonormal bases and semi-definite and semi-infinite programming
- A relaxed cutting plane method for semi-infinite semi-definite programming
- scientific article; zbMATH DE number 4170652 (Why is no real title available?)
- scientific article; zbMATH DE number 1047600 (Why is no real title available?)
- Solving semidefinite programs via discretization method for solving semiinfinite programming problems
- Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints
This page was built for publication: A solution method for combined semi-infinite and semi-definite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4831772)
