Global convergence of inexact reduced sqp methods
From MaRDI portal
Publication:4338032
DOI10.1080/10556789708805646zbMATH Open0886.49025OpenAlexW2004556812MaRDI QIDQ4338032FDOQ4338032
Authors:
Publication date: 19 April 1998
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556789708805646
Recommendations
- An Infinite-Dimensional Convergence Theory for Reduced SQP Methods in Hilbert Space
- An Inexact SQP Method for Equality Constrained Optimization
- scientific article; zbMATH DE number 589250
- Partially reduced sqp methods for large-scale nonlinear optimization problems
- Inexact SQP Interior Point Methods and Large Scale Optimal Control Problems
Cites Work
- A surperlinearly convergent algorithm for constrained optimization problems
- Inexact Newton Methods
- Infeasible path optimal design methods with applications to aerodynamic shape optimization
- Numerical solution of a nonlinear parabolic control problem by a reduced SQP method
- An analysis of reduced Hessian methods for constrained optimization
- Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization
- A Reduced Hessian Method for Large-Scale Constrained Optimization
- Diagonally Modified Conditional Gradient Methods for Input Constrained Optimal Control Problems
- Rates of convergence for adaptive Newton methods
- Multilevel Algorithms for Constrained Compact Fixed Point Problems
- Functional and numerical solution of a control problem originating from heat transfer
- On the local and global convergence of a reduced Quasi-Newton method1
- An Infinite-Dimensional Convergence Theory for Reduced SQP Methods in Hilbert Space
- Projected Sequential Quadratic Programming Methods
- Title not available (Why is that?)
Cited In (13)
- A note on the implementation of an interior-point algorithm for nonlinear optimization with inexact step computations
- Inexact Newton-Type Optimization with Iterated Sensitivities
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
- A Globally Convergent Stabilized SQP Method
- A sequential method for a class of stable mathematical programming problems
- An inexact ℓ1penalty SQP algorithm for PDE-constrained optimization with an application to shape optimization in linear elasticity
- A line search filter inexact reduced Hessian method for nonlinear equality constrained optimization
- Effect of inexact adjoint solutions on the discrete-adjoint approach to gradient-based optimization
- Sequential hierarchical least-squares programming for prioritized non-linear optimal control
- Global convergence of SSM for minimizing a quadratic over a sphere
- Local Convergence of SQP Methods in Semi-Infinite Programming
- Smooth and robust solutions for Dirichlet boundary control of fluid-solid conjugate heat transfer problems
- Solving discretized optimization problems by partially reduced SQP methods
Uses Software
This page was built for publication: Global convergence of inexact reduced sqp methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4338032)
