A primal-infeasible interior point algorithm for linearly constrained convex programming

MaRDI QIDQ2932930zbMATH OpenFDO

Authors Yanjin Wang, Pusheng Fei

Publication date 9 December 2014

zbMATH Keywords

linearly constrained convex programmingpolynomial complexityprimal-infeasible interior point algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51)

Recommendations

• scientific article; zbMATH DE number 1866539
• A primal-dual infeasible-interior-point algorithm for linear programming
• An infeasible interior proximal method for convex programming problems with linear constraints
• A globally convergent primal-dual interior point algorithm for convex programming
• scientific article; zbMATH DE number 1047678

Cited in

(18)

• A primal-dual infeasible-interior-point algorithm for linear programming
• A globally convergent primal-dual interior point algorithm for convex programming
• An infeasible interior-point algorithm for solving primal and dual geometric programs
• Optimal mechanism design using interior-point methods
• Novel interior point algorithms for solving nonlinear convex optimization problems
• An infeasible-interior-point algorithm using projections onto a convex set
• An interior point parameterized central path following algorithm for linearly constrained convex programming
• An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization
• An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
• An O(n^ 3L) primal interior point algorithm for convex quadratic programming
• An infeasible interior proximal method for convex programming problems with linear constraints
• A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization
• scientific article; zbMATH DE number 1161041 (Why is no real title available?)
• A circular cone relaxation primal interior point algorithm for LP
• scientific article; zbMATH DE number 1489800 (Why is no real title available?)
• scientific article; zbMATH DE number 1782596 (Why is no real title available?)
• An infeasible interior proximal method for convex programming problems with linear constraints
• Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming

This page was built for publication: A primal-infeasible interior point algorithm for linearly constrained convex programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2932930)