An active set feasible method for large-scale minimization problems with bound constraints
type: Item
instance of: scholarly article
title: An active set feasible method for large-scale minimization problems with bound constraints
zbMATH Open document ID: 1284.90075
author: Gianni Di Pillo
author: Stefano Lucidi
author: M. De Santis
published in: Computational Optimization and Applications
publication date: 2013-01-04T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 6121897
zbMATH Keywords: bound constrained minimization problems
zbMATH Keywords: large-scale minimization problems
zbMATH Keywords: active set methods
zbMATH Keywords: projected Newton-type methods
zbMATH Keywords: nonmonotone Newton-type methods
zbMATH Keywords: Barzilai-Borwein gradient methods
describes a project that uses: GALAHAD
describes a project that uses: SifDec
describes a project that uses: CUTEr
MaRDI profile type: Publication
full work available at URL: s10589-012-9506-7
OpenAlex ID: W2003725071
cites work: Second-order negative-curvature methods for box-constrained and general constrained optimization
cites work: Projected Newton Methods for Optimization Problems with Simple Constraints
cites work: Evaluating bound-constrained minimization software
cites work: Q2765611
cites work: Large-scale active-set box-constrained optimization method with spectral projected gradients
cites work: Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
cites work: Truncated-Newton algorithms for large-scale unconstrained optimization
cites work: Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems
cites work: Benchmarking optimization software with performance profiles.
cites work: A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization
cites work: A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
cites work: A new trust region algorithm for bound constrained minimization
cites work: A truncated Newton method with non-monotone line search for unconstrained optimization
cites work: GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
cites work: CUTEr and SifDec
cites work: A New Active Set Algorithm for Box Constrained Optimization
cites work: Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
cites work: On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
cites work: Newton's Method for Large Bound-Constrained Optimization Problems
cites work: Algorithms for bound constrained quadratic programming problems
cites work: On the Solution of Large Quadratic Programming Problems with Bound Constraints
cites work: Family of projected descent methods for optimization problems with simple bounds
cites work: Global Convergence of Trust-region Interior-point Algorithms for Infinite-dimensional Nonconvex Minimization Subject to Pointwise Bounds
DOI: 10.1007/S10589-012-9506-7
description: scientific article; zbMATH DE number 6121897