A new trust region algorithm for bound constrained minimization

DOI10.1007/BF01183013zbMath0821.90101OpenAlexW1994015146MaRDI QIDQ1337095

Sandra Augusta Santos, José Mario Martínez, Ana Friedlander

Publication date: 30 October 1994

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01183013

zbMATH Keywords

global convergencebox constraintsdifferentiable functiontrust-regiondifferent degrees of accuracy

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (49)

Augmented lagrangians and sphere packing problems ⋮ An unconstrained optimization technique for large-scale linearly constrained convex minimization problems ⋮ Solution of linear complementarity problems using minimization with simple bounds ⋮ A decomposition method for large-scale box constrained optimization ⋮ A trust region method for minimization of nonsmooth functions with linear constraints ⋮ 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 optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum ⋮ Optimal iterative QP and QPQC algorithms ⋮ An active set algorithm for nonlinear optimization with polyhedral constraints ⋮ An inverse eigenvalue method for frequency isolation in spring–mass systems ⋮ An increasing‐angle property of the conjugate gradient method and the implementation of large‐scale minimization algorithms with line searches ⋮ Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds ⋮ A new filter method for solving nonlinear complementarity problems ⋮ A new strategy for solving variational inequalities in bounded polytopes^∗ ⋮ An active set feasible method for large-scale minimization problems with bound constraints ⋮ Two-phase model algorithm with global convergence for nonlinear programming ⋮ On a box-constrained linear symmetric cone optimization problem ⋮ On the stationarity for nonlinear optimization problems with polyhedral constraints ⋮ Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints ⋮ A multivariate spectral projected gradient method for bound constrained optimization ⋮ Estimation of optical parameters of very thin films ⋮ Topology optimization of continuum structures with material failure constraints ⋮ Topology optimization for minimum mass design considering local failure constraints and contact boundary conditions ⋮ A feasible direction method for the semidefinite program with box constraints ⋮ Optimal convective heat transfer in double pipe with parabolic fins ⋮ A Trust Regional Algorithm for Bound Constrained Minimization ⋮ A trust region algorithm for a class of nonlinear optimization ⋮ Solving bound constrained optimization via a new nonmonotone spectral projected gradient method ⋮ Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy^∗ ⋮ A minimax method with application to the initial vector coding problem^* ⋮ Globally convergent DC trust-region methods ⋮ Duality-based domain decomposition with natural coarse-space for variational inequalities ⋮ Box-constrained minimization reformulations of complementarity problems in second-order cones ⋮ On the solution of bounded and unbounded mixed complementarity problems ⋮ Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems ⋮ Nonmonotone strategy for minimization of quadratics with simple constraints. ⋮ Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions ⋮ Global Convergence of a Trust Region Algorithm for Nonlinear Inequality Constrained Optimization Problems ⋮ A new trust region method for nonsmooth equations ⋮ Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization ⋮ Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization ⋮ A MODEL FOR OPTIMAL CHEMICAL CONTROL OF LEAF AREA DAMAGED BY FUNGI POPULATION — PARAMETER DEPENDENCE ⋮ New constrained optimization reformulation of complementarity problems ⋮ Global convergence of trust region algorithm for equality and bound constrained nonlinear optimization ⋮ Solution of contact problems by FETI domain decomposition with natural coarse space projections ⋮ A hybrid method for solving variational inequality problems ⋮ A trust region method based on a new affine scaling technique for simple bounded optimization ⋮ The reconstruction of a specially structured Jacobi matrix with an application to damage detection in rods

Uses Software

• LANCELOT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for bound constrained quadratic programming problems
• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
• Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
• Newton’s Method with a Model Trust Region Modification
• On the Solution of Large Quadratic Programming Problems with Bound Constraints

This page was built for publication: A new trust region algorithm for bound constrained minimization