Finding a strict feasible solution of a linear semidefinite program

DOI10.1016/j.amc.2010.12.083zbMath1211.65067OpenAlexW2038450146MaRDI QIDQ632881

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

zbMATH Keywords

linear programmingsemidefinite programmingnumerical experimentsprojective interior point method

Mathematics Subject Classification ID

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

Related Items (3)

An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization ⋮ Estimation under group actions: recovering orbits from invariants ⋮ Finding a strict feasible dual solution of a convex optimization problem

Cites Work

• Feasibility issues in a primal-dual interior-point method for linear programming
• The Analytic Center Cutting Plane Method with Semidefinite Cuts
• 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

This page was built for publication: Finding a strict feasible solution of a linear semidefinite program