Sciweavers

206 search results - page 1 / 42
» A Method for Global Optimization of Large Systems of Quadrat...
Sort
View
COCOS
2003
Springer
117views Optimization» more  COCOS 2003»
13 years 10 months ago
A Method for Global Optimization of Large Systems of Quadratic Constraints
In previous work, we have presented a novel global feasibility solver for the large system of quadratic constraints that arise as subproblems in the solving of hard hybrid problems...
Nitin Lamba, Mark Dietz, Daniel P. Johnson, Mark S...
ICPR
2008
IEEE
14 years 6 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson
SIAMJO
2008
92views more  SIAMJO 2008»
13 years 4 months ago
An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
For a mathematical program with complementarity constraints (MPCC), we propose an active-set Newton method, which has the property of local quadratic convergence under the MPCC lin...
Alexey F. Izmailov, Mikhail V. Solodov
SIAMJO
2010
87views more  SIAMJO 2010»
13 years 3 months ago
A Second Derivative SQP Method: Global Convergence
Abstract. Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second deri...
Nicholas I. M. Gould, Daniel P. Robinson
SIAMSC
2008
147views more  SIAMSC 2008»
13 years 4 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