Results 1  10
of
43
Snopt: An SQP Algorithm For LargeScale Constrained Optimization
, 1997
"... Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first deriv ..."
Abstract

Cited by 328 (18 self)
 Add to MetaCart
Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first derivatives are available, and that the constraint gradients are sparse.
Sequential Quadratic Programming
, 1995
"... this paper we examine the underlying ideas of the SQP method and the theory that establishes it as a framework from which effective algorithms can ..."
Abstract

Cited by 113 (2 self)
 Add to MetaCart
this paper we examine the underlying ideas of the SQP method and the theory that establishes it as a framework from which effective algorithms can
On the implementation of an algorithm for largescale equality constrained optimization
 SIAM Journal on Optimization
, 1998
"... Abstract. This paper describes a software implementation of Byrd and Omojokun’s trust region algorithm for solving nonlinear equality constrained optimization problems. The code is designed for the efficient solution of large problems and provides the user with a variety of linear algebra techniques ..."
Abstract

Cited by 38 (11 self)
 Add to MetaCart
Abstract. This paper describes a software implementation of Byrd and Omojokun’s trust region algorithm for solving nonlinear equality constrained optimization problems. The code is designed for the efficient solution of large problems and provides the user with a variety of linear algebra techniques for solving the subproblems occurring in the algorithm. Second derivative information can be used, but when it is not available, limited memory quasiNewton approximations are made. The performance of the code is studied using a set of difficult test problems from the CUTE collection.
Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
 SIAM Journal on Optimization
, 1997
"... Mathematical programs with nonlinear complementarity constraints are reformulated using betterposed but nonsmooth constraints. We introduce a class of functions, parameterized by a real scalar, to approximate these nonsmooth problems by smooth nonlinear programs. This smoothing procedure has the ex ..."
Abstract

Cited by 35 (0 self)
 Add to MetaCart
Mathematical programs with nonlinear complementarity constraints are reformulated using betterposed but nonsmooth constraints. We introduce a class of functions, parameterized by a real scalar, to approximate these nonsmooth problems by smooth nonlinear programs. This smoothing procedure has the extra benefits that it often improves the prospect of feasibility and stability of the constraints of the associated nonlinear programs and their quadratic approximations. We present two globally convergent algorithms based on sequential quadratic programming, SQP, as applied in exact penalty methods for nonlinear programs. Global convergence of the implicit smooth SQP method depends on existence of a lowerlevel nondegenerate (strictly complementary) limit point of the iteration sequence. Global convergence of the explicit smooth SQP method depends on a weaker property, i.e. existence of a limit point at which a generalized constraint qualification holds. We also discuss some practical matter...
A reduced Hessian method for largescale constrained optimization
 SIAM JOURNAL ON OPTIMIZATION
, 1995
"... ..."
The ULagrangian of a convex function
 Trans. Amer. Math. Soc
"... Abstract. At a given point p, a convex function f is differentiable in a certain subspace U (the subspace along which ∂f(p) has 0breadth). This property opens the way to defining a suitably restricted second derivative of f at p. We do this via an intermediate function, convex on U. We call this fu ..."
Abstract

Cited by 25 (7 self)
 Add to MetaCart
Abstract. At a given point p, a convex function f is differentiable in a certain subspace U (the subspace along which ∂f(p) has 0breadth). This property opens the way to defining a suitably restricted second derivative of f at p. We do this via an intermediate function, convex on U. We call this function the ULagrangian; it coincides with the ordinary Lagrangian in composite cases: exact penalty, semidefinite programming. Also, we use this new theory to design a conceptual pattern for superlinearly convergent minimization algorithms. Finally, we establish a connection with the MoreauYosida regularization. 1.
Fast Recursive SQP Methods for LargeScale Optimal Control Problems
, 1995
"... Direct boundary value problem methods in combination with SQP iteration have proved to be very successful in solving nonlinear optimal control problems. Such methods use parameterized control functions, discretize the state differential equations by, e.g., multiple shooting or collocation, and treat ..."
Abstract

Cited by 23 (8 self)
 Add to MetaCart
Direct boundary value problem methods in combination with SQP iteration have proved to be very successful in solving nonlinear optimal control problems. Such methods use parameterized control functions, discretize the state differential equations by, e.g., multiple shooting or collocation, and treat the discretized boundary value problem as an equality constraint in a large, nonlinear, constrained optimization problem. In reallife applications several thousand variables may appear in the NLP. Solution by standard techniques is therefore impractical. This dissertation develops a general concept for a class of structured direct SQP methods based on a decoupling strategy. A careful choice of the discretization reveals an inherent multistage block structure of the QP subproblems. We present a recursive solution algorithm for the associated KKT systems which makes full use of this sparse structure, and propose a structurepreserving primaldual interior point method for treating the genera...
A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
 SIAM Journal on Optimization
, 2001
"... . A sequential quadratic programming (SQP) algorithm generating feasible iterates is described and analyzed. What distinguishes this algorithm from previous feasible SQP algorithms proposed by various authors is a reduction in the amount of computation required to generate a new iterate while the pr ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
. A sequential quadratic programming (SQP) algorithm generating feasible iterates is described and analyzed. What distinguishes this algorithm from previous feasible SQP algorithms proposed by various authors is a reduction in the amount of computation required to generate a new iterate while the proposed scheme still enjoys the same global and fast local convergence properties. A preliminary implementation has been tested and some promising numerical results are reported. Key words. sequential quadratic programming, SQP, feasible iterates, feasible SQP, FSQP AMS subject classifications. 49M37, 65K05, 65K10, 90C30, 90C53 PII. S1052623498344562 1.
Quadratically And Superlinearly Convergent Algorithms For The Solution Of Inequality Constrained Minimization Problems
, 1995
"... . In this paper some Newton and quasiNewton algorithms for the solution of inequality constrained minimization problems are considered. All the algorithms described produce sequences fx k g converging qsuperlinearly to the solution. Furthermore, under mild assumptions, a qquadratic convergence ra ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
. In this paper some Newton and quasiNewton algorithms for the solution of inequality constrained minimization problems are considered. All the algorithms described produce sequences fx k g converging qsuperlinearly to the solution. Furthermore, under mild assumptions, a qquadratic convergence rate in x is also attained. Other features of these algorithms are that the solution of linear systems of equations only is required at each iteration and that the strict complementarity assumption is never invoked. First the superlinear or quadratic convergence rate of a Newtonlike algorithm is proved. Then, a simpler version of this algorithm is studied and it is shown that it is superlinearly convergent. Finally, quasiNewton versions of the previous algorithms are considered and, provided the sequence defined by the algorithms converges, a characterization of superlinear convergence extending the result of Boggs, Tolle and Wang is given. Key Words. Inequality constrained optimization, New...
Nonmonotone Line Search for Minimax Problems
, 1993
"... . It was recently shown that, in the solution of smooth constrained optimization problems by sequential quadratic programming (SQP), the Maratos effect can be prevented by means of a certain nonmonotone (more precisely, threestep or fourstep monotone) line search. Using a well known transformation ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
. It was recently shown that, in the solution of smooth constrained optimization problems by sequential quadratic programming (SQP), the Maratos effect can be prevented by means of a certain nonmonotone (more precisely, threestep or fourstep monotone) line search. Using a well known transformation, this scheme can be readily extended to the case of minimax problems. It turns out however that, due to the structure of these problems, one can use a simpler scheme. Such a scheme is proposed and analyzed in this paper. Numerical experiments indicate a significant advantage of the proposed line search over the (monotone) Armijo search. Key words. Minimax problems, SQP direction, Maratos effect, Superlinear convergence. 1 This research was supported in part by NSF's Engineering Research Centers Program No. NSFDCDR88 03012, by NSF grant No. DMC8815996 and by a grant from the Westinghouse Corporation. 2 To whom the correspondence should be addressed. 1. Introduction. Consider the "m...