Sciweavers

18 search results - page 1 / 4
» SNOPT: An SQP Algorithm for Large-Scale Constrained Optimiza...
Sort
View
SIAMJO
2002
133views more  SIAMJO 2002»
13 years 4 months ago
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
Philip E. Gill, Walter Murray, Michael A. Saunders
SIAMSC
2010
132views more  SIAMSC 2010»
12 years 11 months ago
An Interior-Point Algorithm for Large-Scale Nonlinear Optimization with Inexact Step Computations
We present a line-search algorithm for large-scale continuous optimization. The algorithm is matrix-free in that it does not require the factorization of derivative matrices. Inste...
Frank E. Curtis, Olaf Schenk, Andreas Wächter
SIAMJO
2008
114views more  SIAMJO 2008»
13 years 4 months ago
An Inexact SQP Method for Equality Constrained Optimization
We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that ca...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal
CEC
2008
IEEE
13 years 10 months ago
A study on constrained MA using GA and SQP: Analytical vs. finite-difference gradients
— Many deterministic algorithms in the context of constrained optimization require the first-order derivatives, or the gradient vectors, of the objective and constraint function...
Stephanus Daniel Handoko, Chee Keong Kwoh, Yew-Soo...
SIAMJO
2010
83views more  SIAMJO 2010»
13 years 2 months ago
The Lifted Newton Method and Its Application in Optimization
Abstract. We present a new “lifting” approach for the solution of nonlinear optimization problems (NLPs) that have objective and constraint functions with intermediate variable...
Jan Albersmeyer, Moritz Diehl