The Projective SUMT Method for Convex Programming
From MaRDI portal
Publication:3830821
DOI10.1287/moor.14.2.203zbMath0675.90067OpenAlexW2089876425MaRDI QIDQ3830821
Publication date: 1989
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.14.2.203
logarithmic barrier functionbinding constraint gradientsmatrix inversion approximationprojective SUMT method
Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)
Related Items
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, Rank-one techniques in log-barrier function methods for linear programming, A homotopy method for solving bilevel programming problem, Primal-dual algorithms for linear programming based on the logarithmic barrier method, Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem, 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, Perturbed variations of penalty function methods. Example: Projective SUMT, On the complexity of a combined homotopy interior method for convex programming, Inertial Game Dynamics and Applications to Constrained Optimization, A combined homotopy interior point method for convex nonlinear programming, A quadratically convergent scaling newton’s method for nonlinear complementarity 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, Legendre transform and applications to finite and infinite optimization, A polynomial path following algorithm for convex programming, A feasible interior-point algorithm for nonconvex nonlinear programming, The aggregate constraint homotopy method for nonconvex nonlinear programming, A quadratically convergent scaling newton’s method for nonlinear programming problems, A continuation method for solving convex programming problemsviafischer reformulation, A globally convergent interior point algorithm for non-convex nonlinear programming, A two parameter mixed interior-exterior penalty algorithm, K-K-T multiplier estimates and objective function lower bounds from projective SUMT, Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm
