A dual approach to solving nonlinear programming problems by unconstrained optimization

Cites work

A general saddle point result for constrained optimization
A new method for the optimization of a nonlinear function subject to nonlinear constraints
Convex Analysis
scientific article; zbMATH DE number 3307153 (Why is no real title available?)
scientific article; zbMATH DE number 3309655 (Why is no real title available?)
scientific article; zbMATH DE number 3378720 (Why is no real title available?)
scientific article; zbMATH DE number 3409146 (Why is no real title available?)
scientific article; zbMATH DE number 3412414 (Why is no real title available?)
scientific article; zbMATH DE number 3424739 (Why is no real title available?)
Multiplier and gradient methods
On the method of multipliers for mathematical programming problems
Ordinary convex programs without a duality gap
The multiplier method of Hestenes and Powell applied to convex programming
Use of the augmented penalty function in mathematical programming problems. I

Cited in

(only showing first 100 items - show all)

Convergence of the augmented Lagrangian method for nonlinear optimization problems over second-order cones
Log-sigmoid nonlinear Lagrange method for nonlinear optimization problems over second-order cones
A constrained min-max algorithm for rival models
A superlinearly convergent constrained min-max algorithm for rival models of the same system
A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
A globally convergent, implementable multiplier method with automatic penalty limitation
Second-order optimality conditions for a class of nonlinear programming problems
A constrained min-max algorithm for rival models of the same economic system
Multiplier methods: A survey
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
A second-order method for the general nonlinear programming problem
Convexification procedures and decomposition methods for nonconvex optimization problems
The value function of a mixed integer program. II
Implied constraints and a unified theory of duality in linear and nonlinear programming
Analysis and implementation of a dual algorithm for constrained optimization
Interior dual proximal point algorithm for linear programs
Nonlinear rescaling and proximal-like methods in convex optimization
Augmented Lagrangian theory, duality and decomposition methods for variational inequality problems
Solution of thin film magnetization problems in type-II superconductivity
Instantaneous voiced/non-voiced detection in speech signals based on variational mode decomposition
Two-dimensional compact variational mode decomposition
A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem
Efficient semidefinite branch-and-cut for MAP-MRF inference
On the twice differentiable cubic augmented Lagrangian
A genetic algorithm based augmented Lagrangian method for constrained optimization
A strongly convergent proximal point method for vector optimization
Augmented Lagrangian method for second-order cone programs under second-order sufficiency
Convergence of an augmented Lagrange algorithm for nonlinear optimizations with second-order cone constraints
Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming
On the cost of solving augmented Lagrangian subproblems
The rate of convergence of proximal method of multipliers for equality constrained optimization problems
Sign projected gradient flow: a continuous-time approach to convex optimization with linear equality constraints
Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming
On the combination of the multiplier method of Hestenes and Powell with Newton's method
Lagrangian transformation and interior ellipsoid methods in convex optimization
A convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems
A nonlinear Lagrangian based on Fischer-Burmeister NCP function
Comparison of bundle and classical column generation
A proximal-point SQP trust region method for solving some special class of nonlinear semi-definite programming problems
A nonlinear Lagrangian for constrained optimization problems
The multiplier method of Hestenes and Powell applied to convex programming
Lagrange optimality system for a class of nonsmooth convex optimization
On how to solve large-scale log-determinant optimization problems
The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
Decomposition methods based on augmented Lagrangians: a survey
The Legendre transformation in modern optimization
A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints
A new nonlinear Lagrangian method for nonconvex semidefinite programming
A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM
A new family of penalties for augmented Lagrangian methods
A splitting algorithm for image segmentation on manifolds represented by the grid based particle method
scientific article; zbMATH DE number 3810739 (Why is no real title available?)
scientific article; zbMATH DE number 3948007 (Why is no real title available?)
A class of convergent primal-dual subgradient algorithms for decomposable convex programs
Acceleration of the leastpth algorithm for minimax optimization with engineering applications
Extremal problems with an infinite number of inequality constraints
Global saddle-point duality for quasi-concave programs
scientific article; zbMATH DE number 3727086 (Why is no real title available?)
A method of centers algorithm for certain minimax problems
A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function
On the reduction of the normality conditions in equality-constrained optimization problems in mechanics
scientific article; zbMATH DE number 61459 (Why is no real title available?)
Multiplier method and optimal control problems with terminal state constraints
Feasible directions algorithms for optimization problems with equality and inequality constraints
scientific article; zbMATH DE number 3550576 (Why is no real title available?)
The use of augmented lagrangian functions for sensitivity analysis in nonlinear programming
Multiplier functions and duality for non-linear programmes having a set constraint
Nonlinear leastpth optimization and nonlinear programming
Perturbation des méthodes d'optimisation. Applications
Algorithms for nonlinear constraints that use lagrangian functions
A characterization of the optimal set of linear programs based on the augmented lagrangian
Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
Mechanical design problems with unilateral contact
The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones
The multiplier-penalty method for generalized Nash equilibrium problems in Banach spaces
On Error Bounds and Multiplier Methods for Variational Problems in Banach Spaces
Funciones penalidad y lagrangianos aumentados
scientific article; zbMATH DE number 858666 (Why is no real title available?)
Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems
Safeguarded augmented Lagrangian methods in Banach spaces
Primal-Dual Stochastic Gradient Method for Convex Programs with Many Functional Constraints
Local convergence analysis of augmented Lagrangian methods for piecewise linear-quadratic composite optimization problems
Nonlinear rescaling Lagrangians for nonconvex semidefinite programming
Augmented Lagrangian methods for variational inequality problems
The rate of convergence of proximal method of multipliers for nonlinear semidefinite programming
The rate of convergence of a NLM based on F-B NCP for constrained optimization problems without strict complementarity
A class of nonlinear Lagrangians for nonconvex second order cone programming
The rate of convergence of proximal method of multipliers for nonlinear programming
A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
Study of variational inequality and equality formulations for elastostatic frictional contact problems
Unit commitment by augmented Lagrangian relaxation: testing two decomposition approaches
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
The rate of convergence of augmented Lagrangian method for minimax optimization problems with equality constraints

This page was built for publication: A dual approach to solving nonlinear programming problems by unconstrained optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4767127)