Family of projected descent methods for optimization problems with simple bounds

DOI10.1023/A:1022690711754zbMath0886.90140OpenAlexW1499828147MaRDI QIDQ1364228

O. Diekmann

Publication date: 25 August 1997

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022690711754

zbMATH Keywords

inexact line searchlarge-scale minimizationlimited-memory BFGS quasi-Newton methodprojected descent direction algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (31)

Some recent advances in projection-type methods for variational inequalities ⋮ A two-stage active-set algorithm for bound-constrained optimization ⋮ KL-optimum designs: theoretical properties and practical computation ⋮ An interior-point affine-scaling trust-region method for semismooth equations with box constraints ⋮ An active set algorithm for nonlinear optimization with polyhedral constraints ⋮ Interactive dynamic optimization server – connecting one modelling language with many solvers ⋮ Optimal control methodology for the counter-terrorism strategies: the relaxation based approach ⋮ A first-order numerical approach to switched-mode systems optimization ⋮ On the hybrid LQ-based control design for linear networked systems ⋮ An active set feasible method for large-scale minimization problems with bound constraints ⋮ Economic NMPC for averaged infinite horizon problems with periodic approximations ⋮ A novel projected gradient-like method for optimization problems with simple constraints ⋮ Recent advances in nonconvex semi-infinite programming: applications and algorithms ⋮ Optimal control for multistage nonlinear dynamic system of microbial bioconversion in batch culture ⋮ An approximations based approach to optimal control of switched dynamic systems ⋮ A feasible direction method for the semidefinite program with box constraints ⋮ A Subspace Modified PRP Method for Large-scale Nonlinear Box-Constrained Optimization ⋮ Globally convergent DC trust-region methods ⋮ On a variational approach to optimization of hybrid mechanical systems ⋮ Convergence properties of nonmonotone spectral projected gradient methods ⋮ Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization ⋮ Necessary and sufficient conditions for optimality of nonsmooth semi-infinite programming ⋮ Preface ⋮ Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization ⋮ Local convergence analysis of projection-type algorithms: unified approach ⋮ Object Library of Algorithms for Dynamic Optimization Problems: Benchmarking SQP and Nonlinear Interior Point Methods ⋮ Optimal control of impulsive hybrid systems ⋮ Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems ⋮ A trust region method based on a new affine scaling technique for simple bounded optimization ⋮ A decomposition method for Lasso problems with zero-sum constraint ⋮ Stochastic optimization on social networks with application to service pricing

Uses Software

• L-BFGS
• LBFGS-B

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the limited memory BFGS method for large scale optimization
• A projected Newton method for minimization problems with nonlinear inequality constraints
• Efficient dynamic programming implementations of Newton's method for unconstrained optimal control problems
• Algorithms for bound constrained quadratic programming problems
• Convergente rate of a penalty-function scheme
• Numerical Experience with Limited-Memory Quasi-Newton and Truncated Newton Methods
• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• Projected gradient methods for linearly constrained problems
• Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
• Updating Quasi-Newton Matrices with Limited Storage
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Clipping-off gradient algorithms to compute optimal controls with constrained magnitude
• Partial conjugate gradient methods for a class of optimal control problems
• On the Goldstein-Levitin-Polyak gradient projection method
• Matrix conditioning and nonlinear optimization
• Restart procedures for the conjugate gradient method
• Projected Newton Methods for Optimization Problems with Simple Constraints
• A Limited Memory Algorithm for Bound Constrained Optimization
• Solution of Optimal Control Problems by a Pointwise Projected Newton Method
• Consistent Approximations for Optimal Control Problems Based on Runge–Kutta Integration
• Convex programming in Hilbert space
• On the convergence of sequential minimization algorithms

This page was built for publication: Family of projected descent methods for optimization problems with simple bounds