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

DOI10.1007/BF01581083zbMATH Open0787.90068MaRDI QIDQ687091FDOQ687091

Publication date: 6 January 1994

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

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

zbMATH Keywords

interior point methods convergence analysis convex programs nonsmooth Newton subroutine path-following algorithm

Mathematics Subject Classification ID

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

Cites Work

Title not available (Why is that?)
Convex Analysis
A nonsmooth version of Newton's method
Optimization and nonsmooth analysis
A polynomial-time algorithm, based on Newton's method, for linear programming
On some efficient interior point methods for nonlinear convex programming
A new algorithm for minimizing convex functions over convex sets
An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
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
An extension of Karmarkar's projective algorithm for convex quadratic programming
A new continuation method for complementarity problems with uniform P- functions
Generalized Linear-Quadratic Problems of Deterministic and Stochastic Optimal Control in Discrete Time
An Algorithm for Convex Quadratic Programming That Requires O(n^3.5L) Arithmetic Operations
Title not available (Why is that?)
An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
On the convergence of the method of analytic centers when applied to convex quadratic programs
Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
On computing the center of a convex quadratically constrained set
Title not available (Why is that?)
Title not available (Why is that?)
A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems
Title not available (Why is that?)
Title not available (Why is that?)

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
Title not available (Why is that?)
Title not available (Why is that?)
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)