Residual Selection in A Projection Method for Convex Minimization Problems

DOI10.1080/0233193031000079883zbMath1057.49021OpenAlexW2049628711MaRDI QIDQ4430670

Andrzej Cegielski, R. Dylewski

Publication date: 12 October 2003

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0233193031000079883

zbMATH Keywords

projection methodacceleration of convergenceconvex minimizationsubgradient selectionlong stepsresidual selection

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (6)

Superiorization with level control ⋮ Variable target value relaxed alternating projection method ⋮ Approximate level method for nonsmooth convex minimization ⋮ Projection methods for the linear split feasibility problems ⋮ Reflection-projection method for convex feasibility problems with an obtuse cone ⋮ A generalized projection-based scheme for solving convex constrained optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems
• Variable target value subgradient method
• A method of projection onto an acute cone with level control in convex minimization
• New variants of bundle methods
• Numerical behavior of the method of projection onto an acute cone with level control in convex minimization
• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
• An Efficient Method to Solve the Minimax Problem Directly
• The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
• The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions
• Obtuse cones and Gram matrices with non-negative inverse

This page was built for publication: Residual Selection in A Projection Method for Convex Minimization Problems