On Penalty and Multiplier Methods for Constrained Minimization
From MaRDI portal
Publication:4087862
DOI10.1137/0314017zbMath0324.49029OpenAlexW1998150031WikidataQ90648824 ScholiaQ90648824MaRDI QIDQ4087862
Publication date: 1976
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0314017
Related Items
On the convergence properties of a second-order augmented Lagrangian method for nonlinear programming problems with inequality constraints, A class of augmented Lagrangians for equality constraints in nonlinear programming problems, Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints, Application of the method of multipliers to state space constrained optimal control problems with discrete time, Pathfollowing methods in nonlinear optimization III: Lagrange multiplier embedding, A two-stage feasible directions algorithm for nonlinear constrained optimization, Algorithms for a class of nondifferentiable problems, A proximal augmented Lagrangian method for equilibrium problems, Solving Lagrangian variational inequalities with applications to stochastic programming, A globally convergent, implementable multiplier method with automatic penalty limitation, Convergence rate estimates for penalty methods revisited, Une modification du modèle de Mindlin pour les plaques minces en flexion présentant un bord libre, The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones, Penalty function methods and a duality gap for invex optimization problems, The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming, An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems, The Linear and Asymptotically Superlinear Convergence Rates of the Augmented Lagrangian Method with a Practical Relative Error Criterion, A Priori Error Estimates for Space-Time Finite Element Discretization of Parabolic Time-Optimal Control Problems, A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints, INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES, Multiplier methods: A survey, Generalized pearson distributions and nonlinear programing, On using exterior penalty approaches for solving linear programming problems, A multiplier method with automatic limitation of penalty growth, Augmented Lagrangian methods for variational inequality problems, Approximation procedures based on the method of multipliers, Accelerated convergence for the Powell/Hestenes multiplier method, On the convergence properties of second-order multiplier methods, Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints, A second-order method for the general nonlinear programming problem, Convexification procedures and decomposition methods for nonconvex optimization problems, Properties of updating methods for the multipliers in augmented Lagrangians, Convergence of the augmented Lagrangian method for nonlinear optimization problems over second-order cones, A smoothing iterative method for the finite minimax problem, Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints, Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming, Funciones penalidad y lagrangianos aumentados, The Rate of Convergence of a NLM Based on F–B NCP for Constrained Optimization Problems Without Strict Complementarity, Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints, A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints