Pages that link to "Item:Q4087862"
From MaRDI portal
The following pages link to On Penalty and Multiplier Methods for Constrained Minimization (Q4087862):
Displayed 40 items.
- The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones (Q458938) (← links)
- Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints (Q727385) (← links)
- Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints (Q785630) (← links)
- On the convergence properties of a second-order augmented Lagrangian method for nonlinear programming problems with inequality constraints (Q831373) (← links)
- Penalty function methods and a duality gap for invex optimization problems (Q923993) (← links)
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming (Q927160) (← links)
- An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems (Q939107) (← links)
- Convergence of the augmented Lagrangian method for nonlinear optimization problems over second-order cones (Q1014035) (← links)
- Algorithms for a class of nondifferentiable problems (Q1136702) (← links)
- A globally convergent, implementable multiplier method with automatic penalty limitation (Q1145623) (← links)
- Multiplier methods: A survey (Q1223623) (← links)
- Approximation procedures based on the method of multipliers (Q1233814) (← links)
- On the convergence properties of second-order multiplier methods (Q1240019) (← links)
- A second-order method for the general nonlinear programming problem (Q1245156) (← links)
- Convexification procedures and decomposition methods for nonconvex optimization problems (Q1251185) (← links)
- Properties of updating methods for the multipliers in augmented Lagrangians (Q1256396) (← links)
- Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints (Q1321416) (← links)
- Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming (Q2090426) (← links)
- Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints (Q2148118) (← links)
- Solving Lagrangian variational inequalities with applications to stochastic programming (Q2189448) (← links)
- A smoothing iterative method for the finite minimax problem (Q2306388) (← links)
- A class of augmented Lagrangians for equality constraints in nonlinear programming problems (Q2369125) (← links)
- INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES (Q2769521) (← links)
- A multiplier method with automatic limitation of penalty growth (Q3050151) (← links)
- A proximal augmented Lagrangian method for equilibrium problems (Q3225833) (← links)
- Application of the method of multipliers to state space constrained optimal control problems with discrete time (Q3739779) (← links)
- A two-stage feasible directions algorithm for nonlinear constrained optimization (Q3762086) (← links)
- Une modification du modèle de Mindlin pour les plaques minces en flexion présentant un bord libre (Q3790748) (← links)
- Accelerated convergence for the Powell/Hestenes multiplier method (Q3867567) (← links)
- A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints (Q4121703) (← links)
- Generalized pearson distributions and nonlinear programing (Q4142499) (← links)
- A Priori Error Estimates for Space-Time Finite Element Discretization of Parabolic Time-Optimal Control Problems (Q4644425) (← links)
- Funciones penalidad y lagrangianos aumentados (Q4749606) (← links)
- Pathfollowing methods in nonlinear optimization III: Lagrange multiplier embedding (Q4837935) (← links)
- The Linear and Asymptotically Superlinear Convergence Rates of the Augmented Lagrangian Method with a Practical Relative Error Criterion (Q5149515) (← links)
- Augmented Lagrangian methods for variational inequality problems (Q5189878) (← links)
- The Rate of Convergence of a NLM Based on F–B NCP for Constrained Optimization Problems Without Strict Complementarity (Q5265452) (← links)
- A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints (Q5879119) (← links)
- On using exterior penalty approaches for solving linear programming problems (Q5945315) (← links)
- Convergence rate estimates for penalty methods revisited (Q6133302) (← links)