A FULL NT-STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION BASED ON A SELF-REGULAR PROXIMITY

DOI10.1017/S144618111200003XzbMath1242.90293MaRDI QIDQ2895762

Behrouz Kheirfam

Publication date: 4 July 2012

Published in: The ANZIAM Journal (Search for Journal in Brave)

zbMATH Keywords

semidefinite optimizationpolynomial complexityinfeasible interior-point methodself-regular

Mathematics Subject Classification ID

Semidefinite programming (90C22) Interior-point methods (90C51)

Related Items (5)

An infeasible full NT-step interior point method for circular optimization ⋮ A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems ⋮ An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization ⋮ A new infeasible interior-point method based on Darvay's technique for symmetric optimization ⋮ New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization

Cites Work

• Unnamed Item
• Unnamed Item
• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
• Feasibility issues in a primal-dual interior-point method for linear programming
• Self-regular functions and new search directions for linear and semidefinite optimization
• An infeasible interior-point algorithm with full-Newton step for linear optimization
• Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
• A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• Solving Graph Bisection Problems with Semidefinite Programming
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
• New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction

This page was built for publication: A FULL NT-STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION BASED ON A SELF-REGULAR PROXIMITY