Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Augmented Lagrangian method

Known as: Alternating direction method of multipliers 
Augmented Lagrangian methods are a certain class of algorithms for solving constrained optimization problems. They have similarities to penalty… Expand
Wikipedia

Related topics

Related topics

24 relations
AMPLAlgorithmBarrier functionBasis pursuit
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
Using the Maximum Entropy Principle to Combine Simulations and Solution Experiments
Molecular dynamics (MD) simulations allow investigating the structural dynamics of biomolecular systems with unrivaled time and… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Highly Cited
2013
Highly Cited
2013
An efficient augmented Lagrangian method with applications to total variation minimization
Based on the classic augmented Lagrangian multiplier method, we propose, analyze and test an algorithm for solving a class of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2013
Highly Cited
2013
Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
The nuclear norm is widely used to induce low-rank solutions for many optimization problems with matrix variables. Recently, it… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Highly Cited
2010
Highly Cited
2010
Alternating direction augmented Lagrangian methods for semidefinite programming
We present an alternating direction dual augmented Lagrangian method for solving semidefinite programming (SDP) problems in… Expand
  • table 4.1
  • figure 4.1
  • table 4.2
  • table 4.3
  • figure 4.2
Highly Cited
2010
Highly Cited
2010
A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
We consider a Newton-CG augmented Lagrangian method for solving semidefinite programming (SDP) problems from the perspective of… Expand
  • table 1
  • table 1
  • table 2
  • table 3
  • table 4
Highly Cited
2009
Highly Cited
2009
A variable splitting augmented Lagrangian approach to linear spectral unmixing
  • J. Bioucas-Dias
  • First Workshop on Hyperspectral Image and Signal…
  • 2009
    • Corpus ID: 10345958
This paper presents a new linear hyperspectral unmixing method of the minimum volume class, termed simplex identification via… Expand
  • figure 1
  • figure 2
  • table 1
Highly Cited
2008
Highly Cited
2008
Improving ultimate convergence of an augmented Lagrangian method
Optimization methods that employ the classical Powell-Hestenes-Rockafellar augmented Lagrangian are useful tools for solving… Expand
Highly Cited
2007
Highly Cited
2007
On Augmented Lagrangian Methods with General Lower-Level Constraints
Augmented Lagrangian methods with general lower-level constraints are considered in the present research. These methods are… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
Highly Cited
2006
Highly Cited
2006
An Augmented Lagrangian-Based Approach to the Oseen Problem
We describe an effective solver for the discrete Oseen problem based on an augmented Lagrangian formulation of the corresponding… Expand
Highly Cited
2002
Highly Cited
2002
A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
We give a pattern search method for nonlinearly constrained optimization that is an adaption of a bound constrained augmented… Expand
  • figure 2.1
  • figure 3.1
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE