A Reduced Hessian Method for Large-Scale Constrained Optimization

DOI10.1137/0805017zbMath0828.65061OpenAlexW2165622925MaRDI QIDQ4838958

Claudia Schmid, Nocedal, Jorge, Lorenz T. Biegler

Publication date: 10 January 1996

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0805017

zbMATH Keywords

finite differencesuperlinear convergencereduced Hessian methodsuccessive quadratic programming methodlarge-scale constrained optimizationquasi- Newton algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Related Items (18)

A reduced SAND method for optimal design of non-linear structures ⋮ Nonlinear programming without a penalty function or a filter ⋮ Optimal control of two-and three-dimensional incompressible Navier-Stokes flows ⋮ A robust combined trust region–line search exact penalty projected structured scheme for constrained nonlinear least squares ⋮ A cautious BFGS update for reduced Hessian SQP ⋮ An operator-splitting approach for variational optimal control formulations for diffeomorphic shape matching ⋮ Multiple shooting applied to robust reservoir control optimization including output constraints on coherent risk measures ⋮ Global convergence of inexact reduced sqp methods ⋮ A nonmonotone line search filter method with reduced Hessian updating for nonlinear optimization ⋮ A reduced Hessian SQP method for inequality constrained optimization ⋮ A reduced Hessian algorithm with line search filter method for nonlinear programming ⋮ Runge-Kutta based procedure for the optimal control of differential-algebraic equations ⋮ Null-Space Preconditioners for Saddle Point Systems ⋮ Working range optimization for turbine and compressor blading ⋮ An SQP method for the optimal control of large-scale dynamical systems ⋮ Sequential quadratic programming for large-scale nonlinear optimization ⋮ Parallel generalized Lagrange-Newton method for fully coupled solution of PDE-constrained optimization problems with bound-constraints ⋮ Representations of quasi-Newton matrices and their use in limited memory methods

This page was built for publication: A Reduced Hessian Method for Large-Scale Constrained Optimization