An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
From MaRDI portal
Publication:3491323
DOI10.1287/moor.15.3.408zbMath0708.90068OpenAlexW1990735605MaRDI QIDQ3491323
Ilan Adler, Renato D. C. Monteiro
Publication date: 1990
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/9e3e34f1d9b20e13b511725effa135760d5e2049
linear constraintsKarush-Kuhn-Tucker conditionsprimal-dual interior point algorithmconvex separable programming
Numerical mathematical programming methods (65K05) Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (36)
Optimum dimensional synthesis of planar mechanisms with geometric constraints ⋮ AN ENTROPY CONTINUATION METHOD FOR A CLASS OF THE PERIODICITY PROBLEMS OF ORDINARY DIFFERENTIAL EQUATIONS ⋮ A globally convergent primal-dual interior point algorithm for convex programming ⋮ Rank-one techniques in log-barrier function methods for linear programming ⋮ Global convergence in infeasible-interior-point algorithms ⋮ A generalized interior-point barrier function approach for smooth convex programming with linear constraints ⋮ 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 ⋮ A combined homotopy interior point method for general nonlinear programming problems ⋮ On the complexity of a combined homotopy interior method for convex programming ⋮ Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems ⋮ A combined homotopy interior point method for convex nonlinear programming ⋮ Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs ⋮ An extension of predictor-corrector algorithm to a class of convex separable program ⋮ Interior-point methods for nonlinear complementarity problems ⋮ A quadratically convergent scaling newton’s method for nonlinear complementarity problems ⋮ A path following algorithm for a class of convex programming problems ⋮ Homotopy method for a general multiobjective programming problem under generalized quasinormal cone condition ⋮ Homotopy interior-point method for a general multiobjective programming problem ⋮ A noninterior path following algorithm for solving a class of multiobjective programming problems ⋮ On some efficient interior point methods for nonlinear convex programming ⋮ Homotopy method for a general multiobjective programming problem ⋮ An interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programming ⋮ Convergence behavior of interior-point algorithms ⋮ A polynomial path following algorithm for convex programming ⋮ The aggregate constraint homotopy method for nonconvex nonlinear programming ⋮ A quadratically convergent scaling newton’s method for nonlinear programming problems ⋮ A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints ⋮ A globally convergent interior point algorithm for non-convex nonlinear programming ⋮ A spline smoothing homotopy method for nonconvex nonlinear programming ⋮ A Decomposition Algorithm for Nested Resource Allocation Problems ⋮ Inverse optimization for linearly constrained convex separable programming problems ⋮ An interior point parameterized central path following algorithm for linearly constrained convex programming ⋮ Global linear convergence of a path-following algorithm for some monotone variational inequality problems ⋮ Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm
Uses Software
This page was built for publication: An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
