Family of projected descent methods for optimization problems with simple bounds
type: Item
instance of: scholarly article
title: Family of projected descent methods for optimization problems with simple bounds
zbMATH Open document ID: 0886.90140
DOI: 10.1023/A:1022690711754
author: O. Diekmann
published in: Journal of Optimization Theory and Applications
publication date: 1997-08-25T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 1051451
zbMATH Keywords: projected descent direction algorithms
zbMATH Keywords: inexact line search
zbMATH Keywords: large-scale minimization
zbMATH Keywords: limited-memory BFGS quasi-Newton method
describes a project that uses: L-BFGS
describes a project that uses: LBFGS-B
MaRDI profile type: Publication
cites work: Convex programming in Hilbert space
cites work: On the Goldstein-Levitin-Polyak gradient projection method
cites work: Projected Newton Methods for Optimization Problems with Simple Constraints
cites work: A projected Newton method for minimization problems with nonlinear inequality constraints
cites work: Clipping-off gradient algorithms to compute optimal controls with constrained magnitude
cites work: Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
cites work: A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
cites work: A Limited Memory Algorithm for Bound Constrained Optimization
cites work: Algorithms for bound constrained quadratic programming problems
cites work: Projected gradient methods for linearly constrained problems
cites work: Solution of Optimal Control Problems by a Pointwise Projected Newton Method
cites work: On the convergence of sequential minimization algorithms
cites work: Updating Quasi-Newton Matrices with Limited Storage
cites work: Restart procedures for the conjugate gradient method
cites work: Q3688092
cites work: Q3690580
cites work: Q3359644
cites work: Convergente rate of a penalty-function scheme
cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization
cites work: Consistent Approximations for Optimal Control Problems Based on Runge–Kutta Integration
cites work: Partial conjugate gradient methods for a class of optimal control problems
cites work: Efficient dynamic programming implementations of Newton's method for unconstrained optimal control problems
cites work: On the limited memory BFGS method for large scale optimization
cites work: Matrix conditioning and nonlinear optimization
cites work: Numerical Experience with Limited-Memory Quasi-Newton and Truncated Newton Methods
full work available at URL: a:1022690711754
OpenAlex ID: W1499828147
description: scientific article; zbMATH DE number 1051451