A Sequential Method for a Class of Stable Mathematical Programming Problems

DOI10.1137/140985597zbMath1382.65178OpenAlexW2413071457WikidataQ57434181 ScholiaQ57434181MaRDI QIDQ2810550

Karl Kunisch, Kazufumi Ito

Publication date: 3 June 2016

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

Full work available at URL: http://unipub.uni-graz.at/doi/10.1137/140985597

zbMATH Keywords

nonsmooth optimizationmathematical programmingsequential linearizationoptimal bilinear control

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37)

Related Items (1)

A bilevel approach for parameter learning in inverse problems

Cites Work

• Unnamed Item
• Unnamed Item
• Numerical solution of a nonlinear parabolic control problem by a reduced SQP method
• Optimal control from theory to computer programs
• Karush–Kuhn–Tucker Conditions for Nonsmooth Mathematical Programming Problems in Function Spaces
• The lagrange-newton method for infinite-dimensional optimization problems
• Lagrange Multiplier Approach to Variational Problems and Applications
• Optimization with PDE Constraints
• The Local Convergence of Broyden-Like Methods on Lipschitzian Problems in Hilbert Spaces
• Strongly Regular Generalized Equations
• First and second-order necessary and sufficient optimality conditions for infinite-dimensional programming problems
• Global convergence of inexact reduced sqp methods
• Trust Region Methods
• Newton's Method for a Class of Weakly Singular Optimal Control Problems
• Second Order Methods for Optimal Control of Time-Dependent Fluid Flow
• Large-Scale PDE-Constrained Optimization: An Introduction
• Solution of Optimal Control Problems by a Pointwise Projected Newton Method
• Projected Sequential Quadratic Programming Methods
• Mesh-Independence for an Augmented Lagrangian-SQP Method in Hilbert Spaces
• A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization
• A quadratically-convergent algorithm for general nonlinear programming problems

This page was built for publication: A Sequential Method for a Class of Stable Mathematical Programming Problems