Discretization method for semi-definite programming
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 439946 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- A mathematical view of interior-point methods in convex optimization
- A note on an implementation of a method for quadratic semi-infinite programming
- An implementation of a discretization method for semi-infinite programming
- Discretization in semi-infinite programming: the rate of convergence
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semidefinite Programming
Cited in
(4)- Discretization methods for the solution of semi-infinite programming problems
- Approximating optimization problems over convex functions
- Solving semidefinite programs via discretization method for solving semiinfinite programming problems
- A novel neural network for solving semidefinite programming problems with some applications
This page was built for publication: Discretization method for semi-definite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1770709)