The Projective SUMT Method for Convex Programming
From MaRDI portal
Recommendations
- Perturbed variations of penalty function methods. Example: Projective SUMT
- A gradient projection method on an embedding of the feasible set
- scientific article; zbMATH DE number 468924
- Method of alternating contractions and its applications to some convex optimization problems
- scientific article; zbMATH DE number 4119925
- A method of projection onto an acute cone with level control in convex minimization
- Projection algorithms for convex feasibility problem
- Modified procedures of iterative prox-regularization
- Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
Cited in
(31)- A globally convergent interior point algorithm for non-convex nonlinear programming
- On some efficient interior point methods for nonlinear convex programming
- K-K-T multiplier estimates and objective function lower bounds from projective SUMT
- Rank-one techniques in log-barrier function methods for linear programming
- Primal-dual algorithms for linear programming based on the logarithmic barrier method
- A combined homotopy interior point method for general nonlinear programming problems
- A combined homotopy interior point method for convex nonlinear programming
- A noninterior path following algorithm for solving a class of multiobjective programming problems
- A feasible interior-point algorithm for nonconvex nonlinear programming
- A homotopy method for solving bilevel programming problem
- Homotopy method for a general multiobjective programming problem under generalized quasinormal cone condition
- A polynomial path following algorithm for convex programming
- Solving nonlinear programming problems with unbounded non-convex constraint sets via a globally convergent algorithm
- Perturbed variations of penalty function methods. Example: Projective SUMT
- Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions
- Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints
- Inertial game dynamics and applications to constrained optimization
- Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem
- Homotopy interior-point method for a general multiobjective programming problem
- A two parameter mixed interior-exterior penalty algorithm
- A quadratically convergent scaling newton’s method for nonlinear complementarity problems
- A quadratically convergent scaling newton’s method for nonlinear programming problems
- A continuation method for solving convex programming problemsviafischer reformulation
- 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
- Legendre transform and applications to finite and infinite optimization
- Logarithmic SUMT limits in convex programming
- The aggregate constraint homotopy method for nonconvex nonlinear programming
- On the complexity of a combined homotopy interior method for convex programming
- Homotopy method for a general multiobjective programming problem
This page was built for publication: The Projective SUMT Method for Convex Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3830821)
