Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,042,313 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
24 relations
AMPL
Algorithm
Barrier function
Basis pursuit
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
VIA THE ALTERNATING DIRECTION METHOD OF MULTIPLIERS
Mitchell Wasson
,
Mario Milicevic
,
S. Draper
,
G. Gulak
2017
Corpus ID: 8409634
We detail a field-programmable gate array (FPGA) based implementation of linear programming (LP) decoding. LP decoding frames…
Expand
2014
2014
An augmented lagrangian method for sparse SAR imaging
H. Guven
,
M. Çetin
2014
Corpus ID: 6493525
In this paper, we present a solution to the constrained l1-norm minimization problem for sparse SAR imaging. The technique we…
Expand
2011
2011
Graph-Based Marginal Ranking for Update Summarization
Xuan Li
,
Liang Du
,
Yi-Dong Shen
SDM
2011
Corpus ID: 16795156
Update summarization is to summarize a document collection B given that the users have already read another document collection A…
Expand
2009
2009
Distributed decision-making in wireless sensor networks for online structural health monitoring
Qing Ling
,
Z. Tian
,
Yue Li
Journal of Communications and Networks
2009
Corpus ID: 52817829
In a wireless sensor network (WSN) setting, this paper presents a distributed decision-making framework and illustrates its…
Expand
2005
2005
Inexact Semimonotonic Augmented Lagrangians with Optimal Feasibility Convergence for Convex Bound and Equality Constrained Quadratic Programming
Z. Dostál
SIAM Journal on Numerical Analysis
2005
Corpus ID: 207077740
A variant of the augmented Lagrangian-type algorithm for strictly convex quadratic programming problems with bounds and equality…
Expand
2001
2001
Unit commitment by Lagrangian relaxation and genetic algorithms [discussion and closure]
N. Jiménez-Redondo
,
Chuan-Ping Cheng
,
Chih-Wen Liu
,
Chun-Cheng Liu
2001
Corpus ID: 15133019
N Jimenez-Redondo comments on the paper by C.P. Cheng et al. (see ibid, vol.15, no.2, p.707-14, 2000). The original authors reply…
Expand
2001
2001
Hybrid constrained simulated annealing and genetic algorithms for nonlinear constrained optimization
B. Wah
,
Yixin Chen
Proceedings of the Congress on Evolutionary…
2001
Corpus ID: 16066854
The paper presents a framework that unifies various search mechanisms for solving constrained nonlinear programming (NLP…
Expand
1998
1998
Vertical orbital structure around the Lagrangian points in barred galaxies. Link with the secular evolution of galaxies
M. Ollé
,
D. Pfenniger
1998
Corpus ID: 17475753
The stability of the Lagrangian points and the vertical periodic orbits around them is examined in the context of barred galaxies…
Expand
1991
1991
Parallel Constraint Distribution
M. Ferris
,
O. Mangasarian
SIAM Journal on Optimization
1991
Corpus ID: 207057642
Constraints of a mathematical program are distributed among parallel processors together with an appropriately constructed…
Expand
1982
1982
A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function
Hiroshi Yamashita
Mathematical programming
1982
Corpus ID: 206799165
The recently proposed quasi-Newton method for constrained optimization has very attractive local convergence properties. To force…
Expand