Sequential quadratic programming for large-scale nonlinear optimization

DOI10.1016/S0377-0427(00)00429-5zbMath0967.65076OpenAlexW2084387308MaRDI QIDQ1593815

Jon W. Tolle, Paul T. Boggs

Publication date: 3 September 2001

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-0427(00)00429-5

zbMATH Keywords

interior point methodsnonlinear constrained optimizationlarge scale optimizationsequential quadratic programming algorithmreduced Hessians

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Interior-point methods (90C51) Methods of successive quadratic programming type (90C55)

Related Items

Country- and age-specific optimal allocation of dengue vaccines ⋮ Benefits of noise in M-estimators: optimal noise level and probability density ⋮ Radiant heat transfer in nitrogen-free combustion environments ⋮ Some mathematical aspects of price optimisation ⋮ MCMC methods for inference in a mathematical model of pulmonary circulation ⋮ Stiffness and strength topology optimization for bi‐disc systems based on dual sequential quadratic programming ⋮ Topology optimization for disc structures with buckling and displacement constraints ⋮ Plate/shell structure topology optimization of orthotropic material for buckling problem based on independent continuous topological variables ⋮ Efficient optimisation of a vehicle suspension system, using a gradient-based approximation method. I: mathematical modelling ⋮ Space-Time Galerkin POD with Application in Optimal Control of Semilinear Partial Differential Equations ⋮ An efficient dominant failure modes search strategy and an extended sequential compounding method of system reliability analysis and optimization ⋮ An optimization-based approach for high-order accurate discretization of conservation laws with discontinuous solutions ⋮ Implicit shock tracking using an optimization-based high-order discontinuous Galerkin method

Uses Software

• LOQO
• SNOPT

Cites Work

• Unnamed Item
• Unnamed Item
• An interior-point algorithm for nonconvex nonlinear programming
• On the characterization of \(Q\)-superlinear convergence of quasi-Newton interior-point methods for nonlinear programming
• An interior point method for general large-scale quadratic programming problems
• On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization
• The watchdog technique for forcing convergence in algorithms for constrained optimization
• Inexact Newton Methods
• On the Local Convergence of Quasi-Newton Methods for Constrained Optimization
• On the Implementation of an Algorithm for Large-Scale Equality Constrained Optimization
• LOQO:an interior point code for quadratic programming
• A Practical Algorithm for General Large Scale Nonlinear Optimization Problems
• A Global Convergence Analysis of an Algorithm for Large-Scale Nonlinear Optimization Problems
• On the Global Convergence of a Filter--SQP Algorithm
• A Reduced Hessian Method for Large-Scale Constrained Optimization
• A Robust Trust-Region Algorithm with a Nonmonotonic Penalty Parameter Scheme for Constrained Optimization
• A trust region method based on interior point techniques for nonlinear programming.