Solving discretized optimization problems by partially reduced SQP methods
From MaRDI portal
Publication:5933329
DOI10.1007/S007910050008zbMath0970.65066OpenAlexW2087150501MaRDI QIDQ5933329
Publication date: 4 June 2001
Published in: Computing and Visualization in Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s007910050008
optimizationdifferential-algebraic equationsinexact solutionpartially reduced successive quadratic programming methods
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods for differential-algebraic equations (65L80) Methods of successive quadratic programming type (90C55)
Related Items (12)
Forward and inverse problems in modeling of multiphase flow and transport through porous media ⋮ A Multilevel Correction Method for Optimal Controls of Elliptic Equations ⋮ Simultaneous solution approaches for large optimization problems. ⋮ Multigrid optimization for DNS-based optimal control in turbulent channel flows ⋮ Fully implicit Lagrange–Newton–Krylov–Schwarz algorithms for boundary control of unsteady incompressible flows ⋮ Convergence of a two-level ideal algorithm for a parametric shape inverse model problem ⋮ Two-level space-time domain decomposition methods for flow control problems ⋮ A reduced Hessian SQP method for inequality constrained optimization ⋮ On efficient computation of the optimization problem arising in the inverse modeling of non-stationary multiphase multicomponent flow through porous media ⋮ Aerodynamic shape optimization using simultaneous pseudo-timestepping ⋮ Multiple Set Point Partially Reduced SQP Method for Optimal Control of PDE ⋮ Multigrid optimization in applications
Uses Software
This page was built for publication: Solving discretized optimization problems by partially reduced SQP methods
