Results 1  10
of
16
STABILIZED SEQUENTIAL QUADRATIC PROGRAMMING FOR OPTIMIZATION AND A STABILIZED NEWTONTYPE METHOD FOR VARIATIONAL PROBLEMS WITHOUT CONSTRAINT QUALIFICATIONS
, 2007
"... The stabilized version of the sequential quadratic programming algorithm (sSQP) had been developed in order to achieve fast convergence despite possible degeneracy of constraints of optimization problems, when the Lagrange multipliers associated to a solution are not unique. Superlinear convergence ..."
Abstract

Cited by 24 (14 self)
 Add to MetaCart
(Show Context)
The stabilized version of the sequential quadratic programming algorithm (sSQP) had been developed in order to achieve fast convergence despite possible degeneracy of constraints of optimization problems, when the Lagrange multipliers associated to a solution are not unique. Superlinear convergence of sSQP had been previously established under the secondorder sufficient condition for optimality (SOSC) and the MangasarianFromovitz constraint qualification, or under the strong secondorder sufficient condition for optimality (in that case, without constraint qualification assumptions). We prove a stronger superlinear convergence result than the above, assuming SOSC only. In addition, our analysis is carried out in the more general setting of variational problems, for which we introduce a natural extension of sSQP techniques. In the process, we also obtain a new error bound for KarushKuhnTucker systems for variational problems.
On attraction of linearly constrained Lagrangian methods and of stabilized and quasiNewton SQP methods to critical multipliers
 MATHEMATICAL PROGRAMMING
, 2009
"... ..."
SHARP PRIMAL SUPERLINEAR CONVERGENCE RESULTS FOR SOME NEWTONIAN METHODS FOR CONSTRAINED OPTIMIZATION
, 2009
"... As is well known, superlinear or quadratic convergence of the primaldual sequence generated by an optimization algorithm does not, in general, imply superlinear convergence of the primal part. Primal convergence, however, is often of particular interest. For the sequential quadratic programming (SQ ..."
Abstract

Cited by 9 (8 self)
 Add to MetaCart
(Show Context)
As is well known, superlinear or quadratic convergence of the primaldual sequence generated by an optimization algorithm does not, in general, imply superlinear convergence of the primal part. Primal convergence, however, is often of particular interest. For the sequential quadratic programming (SQP) algorithm, local primaldual quadratic convergence can be established under the assumptions of uniqueness of the Lagrange multiplier associated to the solution and the secondorder sufficient condition. At the same time, previous primal superlinear convergence results for SQP required to strengthen the first assumption to the linear independence constraint qualification. In this paper, we show that this strengthening of assumptions is actually not necessary. Specifically, we show that once primaldual convergence is assumed or already established, for primal superlinear rate one only needs a certain error bound estimate. This error bound holds, for example, under the secondorder sufficient condition, which is needed for primaldual local analysis in any case. Moreover, in some situations even secondorder sufficiency can be relaxed to the weaker assumption that the multiplier in question is noncritical. Our study is performed for a rather general perturbed SQP framework, which covers in addition to SQP and quasiNewton SQP some other algorithms as well. For example, as a byproduct,
Local convergence of the method of multipliers for variational and optimization problems under the sole noncriticality assumption. August 2013. Available at http://pages.cs.wisc.edu/˜solodov/solodov.html
"... We present local convergence analysis of the method of multipliers for equalityconstrained variational problems (in the special case of optimization, also called the augmented Lagrangian method) under the sole assumption that the dual starting point is close to a noncritical Lagrange multiplier (wh ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
We present local convergence analysis of the method of multipliers for equalityconstrained variational problems (in the special case of optimization, also called the augmented Lagrangian method) under the sole assumption that the dual starting point is close to a noncritical Lagrange multiplier (which is weaker than secondorder sufficiency). Local superlinear convergence is established under the appropriate control of the penalty parameter values. For optimization problems, we demonstrate in addition local linear convergence for sufficiently large fixed penalty parameters. Both exact and inexact versions of the method are considered. Contributions with respect to previous stateoftheart analyses for equalityconstrained problems consist in the extension to the variational setting, in using the weaker noncriticality assumption instead of the usual secondorder sufficient optimality condition, and in relaxing the smoothness requirements on the problem data. In the context of optimization problems, this gives the first local convergence results for the augmented Lagrangian method under the assumptions that do not include any constraint qualifications and are weaker than the secondorder sufficient optimality condition. We also show that the analysis under the noncriticality assumption cannot be extended to the case with inequality constraints, unless the strict complementarity condition is added (this, however, still gives a new result).
Stabilized SQP revisited
 MATH. PROGRAM., SER. A
, 2010
"... The stabilized version of the sequential quadratic programming algorithm (sSQP) had been developed in order to achieve superlinear convergence in situations when the Lagrange multipliers associated to a solution are not unique. Within the framework of Fischer (Math Program 94:91–124, 2002), the key ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The stabilized version of the sequential quadratic programming algorithm (sSQP) had been developed in order to achieve superlinear convergence in situations when the Lagrange multipliers associated to a solution are not unique. Within the framework of Fischer (Math Program 94:91–124, 2002), the key to local superlinear convergence of sSQP are the following two properties: upper Lipschitzian behavior of solutions of the KarushKuhnTucker (KKT) system under canonical perturbations and local solvability of sSQP subproblems with the associated primaldual step being of the order of the distance from the current iterate to the solution set of the unperturbed KKT system. According to Fernández and Solodov (Math Program 125:47–73, 2010), both of these properties are ensured by the secondorder sufficient optimality condition (SOSC) without any constraint qualification assumptions. In this paper, we state precise relationships between the upper Lipschitzian property of solutions of KKT systems, error bounds for KKT systems, the notion of critical Lagrange multipliers (a subclass of multipliers that violate SOSC in a very special way), the secondorder necessary condition for optimality, and solvability of sSQP subproblems. Moreover,
Stabilized SQP revisited
, 2010
"... The stabilized version of the sequential quadratic programming algorithm (sSQP) had been developed in order to achieve superlinear convergence in situations when the Lagrange multipliers associated to a solution are not unique. Within the framework of [11], the key to local superlinear convergence o ..."
Abstract
 Add to MetaCart
(Show Context)
The stabilized version of the sequential quadratic programming algorithm (sSQP) had been developed in order to achieve superlinear convergence in situations when the Lagrange multipliers associated to a solution are not unique. Within the framework of [11], the key to local superlinear convergence of sSQP are the following two properties: upper Lipschitzian behavior of solutions of the KarushKuhnTucker (KKT) system under canonical perturbations and local solvability of sSQP subproblems with the associated primaldual step being of the order of the distance from the current iterate to the solution set of the unperturbed KKT system. According to [9], both of these properties are ensured by the secondorder sufficient optimality condition (SOSC) without any constraint qualification assumptions. In this paper, we state precise relationships between the upper Lipschitzian property of solutions of KKT systems, error bounds for KKT systems, the notion of critical Lagrange multipliers (a subclass of multipliers that violate SOSC in a very special way), the secondorder necessary condition for optimality, and solvability of sSQP subproblems. Moreover, for the problem with equality constraints only, we prove superlinear convergence of sSQP under the assumption that the dual starting point is close to a noncritical multiplier. Since noncritical multipliers include all those satisfying SOSC but are not
Stabilized sequential quadratic programming for optimization and a stabilized Newtontype method for variational problems
, 2010
"... ..."
(Show Context)
PRONEX–Optimization, and by FAPERJ.
, 2013
"... Local convergence of the method of multipliers for variational and optimization problems under the noncriticality assumption ..."
Abstract
 Add to MetaCart
(Show Context)
Local convergence of the method of multipliers for variational and optimization problems under the noncriticality assumption
SOME COMPOSITESTEP CONSTRAINED OPTIMIZATION METHODS INTERPRETED VIA THE PERTURBED SEQUENTIAL QUADRATIC PROGRAMMING FRAMEWORK
, 2013
"... We consider the inexact restoration and the compositestep sequential quadratic programming (SQP) methods, and relate them to the socalled perturbed SQP framework. In particular, iterations of the methods in question are interpreted as certain structured perturbations of the basic SQP iterations. T ..."
Abstract
 Add to MetaCart
(Show Context)
We consider the inexact restoration and the compositestep sequential quadratic programming (SQP) methods, and relate them to the socalled perturbed SQP framework. In particular, iterations of the methods in question are interpreted as certain structured perturbations of the basic SQP iterations. This gives a different insight into local behaviour of those algorithms, as well as improved or different local convergence and rate of convergence results. Key words: sequential quadratic programming; inexact restoration; perturbed SQP; compositestep SQP; superlinear convergence.