An interior point algorithm of O( m| |) iterations for C^ 1-convex programming

DOI10.1007/BF01581083MaRDI QIDQ687091zbMATH OpenFDO

Authors Jie Sun, Liqun Qi

Publication date 6 January 1994

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

interior point methodsconvergence analysisconvex programsnonsmooth Newton subroutinepath-following algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• Interior-point methods for convex programming
• A generalized interior-point barrier function approach for smooth convex programming with linear constraints
• scientific article; zbMATH DE number 4197759
• On some efficient interior point methods for nonlinear convex programming

Cites work

• scientific article; zbMATH DE number 3928227 (Why is no real title available?)
• scientific article; zbMATH DE number 4102820 (Why is no real title available?)
• scientific article; zbMATH DE number 17721 (Why is no real title available?)
• scientific article; zbMATH DE number 4121759 (Why is no real title available?)
• scientific article; zbMATH DE number 4197759 (Why is no real title available?)
• scientific article; zbMATH DE number 3253619 (Why is no real title available?)
• A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems
• A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
• A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
• A new algorithm for minimizing convex functions over convex sets
• A new continuation method for complementarity problems with uniform P- functions
• A nonsmooth version of Newton's method
• A polynomial-time algorithm, based on Newton's method, for linear programming
• An Algorithm for Convex Quadratic Programming That Requires O(n^3.5L) Arithmetic Operations
• An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
• An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
• An extension of Karmarkar's projective algorithm for convex quadratic programming
• Convex Analysis
• Generalized Linear-Quadratic Problems of Deterministic and Stochastic Optimal Control in Discrete Time
• Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
• On computing the center of a convex quadratically constrained set
• On some efficient interior point methods for nonlinear convex programming
• On the convergence of the method of analytic centers when applied to convex quadratic programs
• Optimization and nonsmooth analysis

Cited in

(14)

• Interior-point methods for convex programming
• Quadratic cost flow and the conjugate gradient method
• New version of the Newton method for nonsmooth equations
• Approximate Newton methods for nonsmooth equations
• Complexity analysis for certain convex programming problems
• Potential reduction method for harmonically convex programming
• A convergence analysis for a convex version of Dikin's algorithm
• scientific article; zbMATH DE number 800120 (Why is no real title available?)
• scientific article; zbMATH DE number 554743 (Why is no real title available?)
• Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems
• Inexact Newton methods for solving nonsmooth equations
• On piecewise quadratic Newton and trust region problems
• Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
• A path following algorithm for a class of convex programming problems

This page was built for publication: An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming

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