Nonmonotone projected gradient methods based on barrier and Euclidean distances

DOI10.1007/s10589-007-9025-0zbMath1190.90129OpenAlexW2004742270MaRDI QIDQ2477010

Paulo J. S. Silva, Marc Teboulle, Alfred Auslender

Publication date: 12 March 2008

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

Full work available at URL: https://doi.org/10.1007/s10589-007-9025-0

zbMATH Keywords

Convergence analysisNonmonotone methodsBarrier proximal distancesConvex and nonconvex optimizationProjected gradient algorithmsSpectral stepsizes

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Methods of reduced gradient type (90C52)

Related Items

An efficient descent direction method with cutting planes, A cyclic block coordinate descent method with generalized gradient projections, Proximal methods for nonlinear programming: Double regularization and inexact subproblems, Variable Metric Inexact Line-Search-Based Methods for Nonsmooth Optimization, An efficient optimization approach for a cardinality-constrained index tracking problem, Hessian Barrier Algorithms for Linearly Constrained Optimization Problems, On the inexact scaled gradient projection method

Uses Software

• SPG
• CUTEr
• SifDec

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A nonmonotone conjugate gradient algorithm for unconstrained optimization
• A truncated Newton method with non-monotone line search for unconstrained optimization
• Mirror descent and nonlinear projected subgradient methods for convex optimization.
• Interior projection-like methods for monotone variational inequalities
• The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography
• Rescaling and Stepsize Selection in Proximal Methods Using Separable Generalized Distances
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A Nonmonotone Line Search Technique for Newton’s Method
• Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
• Algorithm 813
• CUTEr and SifDec
• Interior Gradient and Proximal Methods for Convex and Conic Optimization
• Convex Analysis
• Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization
• Benchmarking optimization software with performance profiles.