Finding a strict feasible solution of a linear semidefinite program
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 6164820
- Finding a strict feasible dual solution of a convex optimization problem
- Solving a class of semidefinite programs via nonlinear programming
- On finding a generalized lowest rank solution to a linear semi-definite feasibility problem
- scientific article; zbMATH DE number 4151744
- A novel approach for solving semidefinite programs
- The semidefinite linear complementarity problem
- scientific article; zbMATH DE number 1985305
- On a structured semidefinite program
- Semidefinite programming
Cites work
- A modified algorithm for the strict feasibility problem
- A numerical feasible interior point method for linear semidefinite programs
- An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
- Feasibility issues in a primal-dual interior-point method for linear programming
- The Analytic Center Cutting Plane Method with Semidefinite Cuts
Cited in
(4)- Finding a strict feasible dual solution of a convex optimization problem
- An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization
- Estimation under group actions: recovering orbits from invariants
- Determination of optimal vertices from feasible solutions in unimodular linear programming
This page was built for publication: Finding a strict feasible solution of a linear semidefinite program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632881)