Journal ArticleDOI
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Reads0
Chats0
TLDR
An SQP algorithm that uses a smooth augmented Lagrangian merit function and makes explicit provision for infeasibility in the original problem and the QP subproblems is discussed and a reduced-Hessian semidefinite QP solver (SQOPT) is discussed.Abstract:
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. Second derivatives are assumed to be unavailable or too expensive to calculate.
We discuss an SQP algorithm that uses a smooth augmented Lagrangian merit function and makes explicit provision for infeasibility in the original problem and the QP subproblems. The Hessian of the Lagrangian is approximated using a limited-memory quasi-Newton method.
SNOPT is a particular implementation that uses a reduced-Hessian semidefinite QP solver (SQOPT) for the QP subproblems. It is designed for problems with many thousands of constraints and variables but is best suited for problems with a moderate number of degrees of freedom (say, up to 2000). Numerical results are given for most of the CUTEr and COPS test collections (about 1020 examples of all sizes up to 40000 constraints and variables, and up to 20000 degrees of freedom).read more
Citations
More filters
Journal ArticleDOI
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
Joel A. Tropp,Anna C. Gilbert +1 more
TL;DR: It is demonstrated theoretically and empirically that a greedy algorithm called orthogonal matching pursuit (OMP) can reliably recover a signal with m nonzero entries in dimension d given O(m ln d) random linear measurements of that signal.
Journal ArticleDOI
CasADi: a software framework for nonlinear optimization and optimal control
TL;DR: This article gives an up-to-date and accessible introduction to the CasADi framework, which has undergone numerous design improvements over the last 7 years.
Journal ArticleDOI
Topology optimization approaches: A comparative review
Ole Sigmund,Kurt Maute +1 more
TL;DR: An overview, comparison and critical review of the different approaches to topology optimization, their strengths, weaknesses, similarities and dissimilarities and suggests guidelines for future research.
Journal ArticleDOI
GPOPS-II: A MATLAB Software for Solving Multiple-Phase Optimal Control Problems Using hp-Adaptive Gaussian Quadrature Collocation Methods and Sparse Nonlinear Programming
Michael A. Patterson,Anil V. Rao +1 more
TL;DR: A general-purpose MATLAB software program called GPOPS--II is described for solving multiple-phase optimal control problems using variable-order Gaussian quadrature collocation methods.
Book ChapterDOI
Disciplined Convex Programming
TL;DR: A new methodology for constructing convex optimization models called disciplined convex programming is introduced, which enforces a set of conventions upon the models constructed, in turn allowing much of the work required to analyze and solve the models to be automated.