On some efficient interior point methods for nonlinear convex programming
From MaRDI portal
Publication:1174840
DOI10.1016/0024-3795(91)90274-ZzbMath0741.65052OpenAlexW2046495869WikidataQ114852076 ScholiaQ114852076MaRDI QIDQ1174840
Publication date: 25 June 1992
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(91)90274-z
complexityquadratic programminginterior-point algorithmspath-following algorithmpotential reduction algorithmlinearly constrained convex programming
Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20)
Related Items
Controlled dual perturbations for central path trajectories in geometric programming, AN ENTROPY CONTINUATION METHOD FOR A CLASS OF THE PERIODICITY PROBLEMS OF ORDINARY DIFFERENTIAL EQUATIONS, A CONSTRUCTIVE PROOF OF THE EXISTENCE OF THE PERIODIC SOLUTION OF THE PERIODICITY PROBLEMS OF ORDINARY DIFFERENTIAL EQUATIONS VIA A NON-INTERIOR POINT ENTROPY CONTINUATION METHOD, A NEW CONTINUATION METHOD FOR THE PERIODICITY PROBLEMS OF ORDINARY DIFFERENTIAL EQUATIONS, A globally convergent primal-dual interior point algorithm for convex programming, A generalized interior-point barrier function approach for smooth convex programming with linear constraints, Asymptotic analysis of a path-following barrier method for linearly constrained convex problems*, Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem, On controlling the parameter in the logarithmic barrier term for convex programming problems, Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints, Interior-point Lagrangian decomposition method for separable convex optimization, A combined homotopy interior point method for general nonlinear programming problems, Solving linear systems involved in constrained optimization, An infeasible interior-point algorithm for solving primal and dual geometric programs, On convex optimization with linear constraints, Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems, A combined homotopy interior point method for convex nonlinear programming, Interior-point methods for nonlinear complementarity problems, Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions, A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier, Path-following barrier and penalty methods for linearly constrained problems, A noninterior path following algorithm for solving a class of multiobjective programming problems, An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming, A polynomial path following algorithm for convex programming, The aggregate constraint homotopy method for nonconvex nonlinear programming, A globally convergent interior point algorithm for non-convex nonlinear programming, A spline smoothing homotopy method for nonconvex nonlinear programming, Method of centers for minimizing generalized eigenvalues, Long-step primal path-following algorithm for monotone variational inequality problems, Perturbed path following predictor-corrector interior point algorithms, A primal-dual infeasible-interior-point algorithm for linear programming, An interior point parameterized central path following algorithm for linearly constrained convex programming, Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm
Cites Work
- Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Interior path following primal-dual algorithms. I: Linear programming
- A polynomial-time algorithm for a class of linear complementarity problems
- Containing and shrinking ellipsoids in the path-following algorithm
- A Centered Projective Algorithm for Linear Programming
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
- The Projective SUMT Method for Convex Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
