A limited-memory multipoint symmetric secant method for bound constrained optimization
From MaRDI portal
Publication:1861917
DOI10.1023/A:1021561204463zbMath1025.90038OpenAlexW1520658537MaRDI QIDQ1861917
Oleg P. Burdakov, Elvio A. Pilotta, José Mario Martínez
Publication date: 10 March 2003
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021561204463
Related Items
A symmetric grouped and ordered multi-secant Quasi-Newton update formula, A new class of supermemory gradient methods, On efficiently combining limited-memory and trust-region techniques, Convex programming with single separable constraint and bounded variables, An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization, Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization, A new multipoint symmetric secant method with a dense initial matrix, A multivariate spectral projected gradient method for bound constrained optimization, Improving ultimate convergence of an augmented Lagrangian method, A Subspace Modified PRP Method for Large-scale Nonlinear Box-Constrained Optimization, Memory gradient method with Goldstein line search, Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization, A Newton-like trust region method for large-scale unconstrained nonconvex minimization, A proximal subgradient projection algorithm for linearly constrained strictly convex problems, Large-scale quasi-Newton trust-region methods with low-dimensional linear equality constraints, Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization, Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
Uses Software
