Global Convergence of Trust-region Interior-point Algorithms for Infinite-dimensional Nonconvex Minimization Subject to Pointwise Bounds
From MaRDI portal
Publication:4253009
DOI10.1137/S0363012997319541zbMath1111.90368WikidataQ58048106 ScholiaQ58048106MaRDI QIDQ4253009
Matthias Heinkenschloss, Stefan Ulbrich, Michael Ulbrich
Publication date: 24 June 1999
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
optimal controlglobal convergenceinterior-point algorithmsnonlinear programmingbound constraintsinfinite-dimensional optimizationtrust-region methodsaffine scaling
Related Items (16)
On the implementation of a quasi-Newton interior-point method for PDE-constrained optimization using finite element discretizations ⋮ An interior-point affine-scaling trust-region method for semismooth equations with box constraints ⋮ On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints ⋮ An active set algorithm for nonlinear optimization with polyhedral constraints ⋮ A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints ⋮ An active set feasible method for large-scale minimization problems with bound constraints ⋮ An Extension of the Projected Gradient Method to a Banach Space Setting with Application in Structural Topology Optimization ⋮ Optimal control for elliptic systems with pointwise Euclidean norm constraints on the controls ⋮ A Flexible Framework for Cubic Regularization Algorithms for Nonconvex Optimization in Function Space ⋮ Trust-region method for box-constrained semismooth equations and its applications to complementary problems ⋮ A trust region interior point algorithm for infinite dimensional nonlinear programming ⋮ Primal-dual interior-point methods for PDE-constrained optimization ⋮ The convergence of an interior point method for an elliptic control problem with mixed control-state constraints ⋮ On two numerical methods for state-constrained elliptic control problems ⋮ Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems ⋮ A trust region method based on a new affine scaling technique for simple bounded optimization
This page was built for publication: Global Convergence of Trust-region Interior-point Algorithms for Infinite-dimensional Nonconvex Minimization Subject to Pointwise Bounds