A dual approach to solving nonlinear programming problems by unconstrained optimization

DOI10.1007/BF01580138zbMath0279.90035OpenAlexW2084478514WikidataQ90649443 ScholiaQ90649443MaRDI QIDQ4767127

R. Tyrrell Rockafellar

Publication date: 1973

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01580138

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

Convergence of augmented Lagrangian methods in extensions beyond nonlinear programming, Study on convex optimization with least constraint violation under a general measure, The augmented Lagrangian method can approximately solve convex optimization with least constraint violation, On Proximal Algorithms with Inertial Effects Beyond Monotonicity, Principled analyses and design of first-order methods with inexact proximal operators, Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming, Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization, An overview of nonlinear optimization, Study of variational inequality and equality formulations for elastostatic frictional contact problems, Unit commitment by augmented Lagrangian relaxation: testing two decomposition approaches, A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints, Interior dual proximal point algorithm for linear programs, The rate of convergence of proximal method of multipliers for second-order cone optimization problems, On the convergence properties of a second-order augmented Lagrangian method for nonlinear programming problems with inequality constraints, On how to solve large-scale log-determinant optimization problems, A characterization of the optimal set of linear programs based on the augmented lagrangian, A nonlinear Lagrangian based on Fischer-Burmeister NCP function, Unified theory of augmented Lagrangian methods for constrained global optimization, Safeguarded Augmented Lagrangian Methods in Banach Spaces, The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems, Unnamed Item, A class of convergent primal-dual subgradient algorithms for decomposable convex programs, Decomposition Methods Based on Augmented Lagrangians: A Survey, A constrained min-max algorithm for rival models, A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints, Nonlinear rescaling and proximal-like methods in convex optimization, Nonlinear rescaling as interior quadratic prox method in convex optimization, On the twice differentiable cubic augmented Lagrangian, Solution of thin film magnetization problems in type-II superconductivity, Instantaneous voiced/non-voiced detection in speech signals based on variational mode decomposition, A superlinearly convergent constrained min-max algorithm for rival models of the same system, A splitting algorithm for image segmentation on manifolds represented by the grid based particle method, A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems, Convergence analysis of the augmented Lagrangian method for nonlinear second-order cone optimization problems, On the reduction of the normality conditions in equality-constrained optimization problems in mechanics, A genetic algorithm based augmented Lagrangian method for constrained optimization, On the cost of solving augmented Lagrangian subproblems, The rate of convergence of proximal method of multipliers for equality constrained optimization problems, The Legendre Transformation in Modern Optimization, A globally convergent, implementable multiplier method with automatic penalty limitation, Second-order optimality conditions for a class of nonlinear programming problems, Split Bregman method for large scale fused Lasso, Primal-Dual Stochastic Gradient Method for Convex Programs with Many Functional Constraints, Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization, Two-dimensional compact variational mode decomposition, Sign projected gradient flow: a continuous-time approach to convex optimization with linear equality constraints, Augmented Lagrangian theory, duality and decomposition methods for variational inequality problems, Multiplier method and optimal control problems with terminal state constraints, A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM, Unnamed Item, The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones, Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming, The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming, The Multiplier-Penalty Method for Generalized Nash Equilibrium Problems in Banach Spaces, Unnamed Item, A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem, A constrained min-max algorithm for rival models of the same economic system, Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems, On Error Bounds and Multiplier Methods for Variational Problems in Banach Spaces, Local Convergence Analysis of Augmented Lagrangian Methods for Piecewise Linear-Quadratic Composite Optimization Problems, Comparison of bundle and classical column generation, On the convergence of the exponential multiplier method for convex programming, Nonlinear rescaling Lagrangians for nonconvex semidefinite programming, Feasible directions algorithms for optimization problems with equality and inequality constraints, Mechanical design problems with unilateral contact, A class of nonlinear Lagrangians for nonconvex second order cone programming, A proximal-point SQP trust region method for solving some special class of nonlinear semi-definite programming problems, The use of augmented lagrangian functions for sensitivity analysis in nonlinear programming, On the combination of the multiplier method of Hestenes and Powell with Newton's method, Acceleration of the leastpth algorithm for minimax optimization with engineering applications, Addressing the greediness phenomenon in nonlinear programming by means of proximal augmented Lagrangians, A new family of penalties for augmented Lagrangian methods, Multiplier methods: A survey, Augmented Lagrangian methods for variational inequality problems, Multiplier functions and duality for non-linear programmes having a set constraint, Nonlinear leastpth optimization and nonlinear programming, A dual algorithm for the solution of nonlinear variational problems via finite element approximation, An augmented Lagrangian method for a class of Inverse quadratic programming problems, Perturbation des méthodes d'optimisation. Applications, Unnamed Item, Algorithms for nonlinear constraints that use lagrangian functions, Extremal problems with an infinite number of inequality constraints, A second-order method for the general nonlinear programming problem, A nonlinear Lagrangian for constrained optimization problems, Convexification procedures and decomposition methods for nonconvex optimization problems, Efficient semidefinite branch-and-cut for MAP-MRF inference, Lagrange optimality system for a class of nonsmooth convex optimization, Existence of augmented Lagrange multipliers for cone constrained optimization problems, A smoothing augmented Lagrangian method for solving simple bilevel programs, A strongly convergent proximal point method for vector optimization, The value function of a mixed integer program. II, Unnamed Item, Convergence of the augmented Lagrangian method for nonlinear optimization problems over second-order cones, The rate of convergence of proximal method of multipliers for nonlinear semidefinite programming, Log-sigmoid nonlinear Lagrange method for nonlinear optimization problems over second-order cones, Unnamed Item, Global saddle-point duality for quasi-concave programs, Augmented Lagrangian method for second-order cone programs under second-order sufficiency, A New Nonlinear Lagrangian Method for Nonconvex Semidefinite Programming, The multiplier method of Hestenes and Powell applied to convex programming, Convergence of an augmented Lagrange algorithm for nonlinear optimizations with second-order cone constraints, A method of centers algorithm for certain minimax problems, Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming, A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function, Funciones penalidad y lagrangianos aumentados, The rate of convergence of proximal method of multipliers for nonlinear programming, Lagrangian transformation and interior ellipsoid methods in convex optimization, The Rate of Convergence of a NLM Based on F–B NCP for Constrained Optimization Problems Without Strict Complementarity, A convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems, Implied constraints and a unified theory of duality in linear and nonlinear programming, Analysis and implementation of a dual algorithm for constrained optimization

Cites Work

• Multiplier and gradient methods
• Ordinary convex programs without a duality gap
• Use of the augmented penalty function in mathematical programming problems. I
• On the method of multipliers for mathematical programming problems
• The multiplier method of Hestenes and Powell applied to convex programming
• A general saddle point result for constrained optimization
• Convex Analysis
• A new method for the optimization of a nonlinear function subject to nonlinear constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item