A Nonlinear Lagrangian Approach to Constrained Optimization Problems

Authors:
X. Q. Yang;X. X. Huang
Affiliations:
-;-
Venue:
SIAM Journal on Optimization
Year:
2000

Citing 0
Cited 15

Approximate Optimal Solutions and Nonlinear Lagrangian Functions*

Journal of Global Optimization
Partially Strictly Monotone and Nonlinear Penalty Functions for Constrained Mathematical Programs

Computational Optimization and Applications
On augmented Lagrangians for Optimization Problems with a Single Constraint

Journal of Global Optimization
Some Results about Duality and Exact Penalization

Journal of Global Optimization
Further Study on Augmented Lagrangian Duality Theory

Journal of Global Optimization
On a Modified Subgradient Algorithm for Dual Problems via Sharp Augmented Lagrangian*

Journal of Global Optimization
Convergence properties of augmented Lagrangian methods for constrained global optimization

Optimization Methods & Software - THE JOINT EUROPT-OMS CONFERENCE ON OPTIMIZATION, 4-7 JULY, 2007, PRAGUE, CZECH REPUBLIC, PART I
Unified theory of augmented Lagrangian methods for constrained global optimization

Journal of Global Optimization
A new augmented Lagrangian approach to duality and exact penalization

Journal of Global Optimization
Extended duality for nonlinear programming

Computational Optimization and Applications
A penalty function method based on smoothing lower order penalty function

Journal of Computational and Applied Mathematics
Augmented Lagrangian function, non-quadratic growth condition and exact penalization

Operations Research Letters
Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems

Journal of Global Optimization
A second-order smooth penalty function algorithm for constrained optimization problems

Computational Optimization and Applications
Exactness and algorithm of an objective penalty function

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Interior point methods for semidefinite optimization (SDO) have recently been studied intensively, due to their polynomial complexity and practical efficiency. Most of these methods are extensions of linear optimization (LO) algorithms. As opposed to ...