Sciweavers

48 search results - page 1 / 10
» Partial Lagrangian relaxation for general quadratic programm...
Sort
View
4OR
2007
116views more  4OR 2007»
13 years 7 months ago
Partial Lagrangian relaxation for general quadratic programming
Alain Faye, Frédéric Roupin
SIAMSC
2008
147views more  SIAMSC 2008»
13 years 7 months ago
Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
We present a two-phase algorithm for solving large-scale quadratic programs (QPs). In the first phase, gradient-projection iterations approximately minimize an augmented Lagrangian...
Michael P. Friedlander, Sven Leyffer
OL
2011
332views Neural Networks» more  OL 2011»
13 years 2 months ago
A robust implementation of a sequential quadratic programming algorithm with successive error restoration
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
Klaus Schittkowski
JSAC
2006
79views more  JSAC 2006»
13 years 7 months ago
Layered Multicast Rate Control Based on Lagrangian Relaxation and Dynamic Programming
In this paper, we address the rate control problem for layered multicast traffic, with the objective of solving a generalized throughput/fairness objective. Our approach is based o...
Koushik Kar, Leandros Tassiulas
ICML
2006
IEEE
14 years 8 months ago
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
Pradeep D. Ravikumar, John D. Lafferty