Finding a strict feasible solution of a linear semidefinite program

DOI10.1016/J.AMC.2010.12.083zbMATH Open1211.65067OpenAlexW2038450146MaRDI QIDQ632881FDOQ632881

Authors: Djamel Benterki, Abdelkrim Keraghel 

Publication date: 28 March 2011

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2010.12.083

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

zbMATH Keywords

linear programmingsemidefinite programmingnumerical experimentsprojective interior point method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51) Semidefinite programming (90C22)

Cites Work

• A modified algorithm for the strict feasibility problem
• Feasibility issues in a primal-dual interior-point method for linear programming
• A numerical feasible interior point method for linear semidefinite programs
• The Analytic Center Cutting Plane Method with Semidefinite Cuts
• An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems

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)