Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO

DOI10.1007/S11075-014-9955-4zbMATH Open1327.90188OpenAlexW1981132378MaRDI QIDQ747738FDOQ747738

Authors: Mohamed Achache, Moufida Goutali 

Publication date: 19 October 2015

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-014-9955-4

Recommendations

• A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization
• SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
• A full-Newton step feasible weighted primal-dual interior point algorithm for monotone LCP
• A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
• New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP

zbMATH Keywords

interior point methodslinearly constrained convex optimizationcomplexity of algorithmsshort-step primal-dual algorithms

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• New interior point algorithms in linear programming
• A new primal-dual path-following method for convex quadratic programming
• New complexity analysis of the primal-dual Newton method for linear optimization
• On well definedness of the central path
• A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization
• A predictor-corrector algorithm for linearly constrained convex optimization

Cited In (6)

• An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization
• Path-following interior-point algorithm for monotone linear complementarity problems
• An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones
• Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
• A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems
• A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization

This page was built for publication: Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO

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