Residual Selection in A Projection Method for Convex Minimization Problems

DOI10.1080/0233193031000079883MaRDI QIDQ4430670zbMATH OpenOpenAlexFDO

Authors Andrzej Cegielski, Robert 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

convex minimizationprojection methodacceleration of convergencesubgradient 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)

Recommendations

• The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
• Projection method with level control in convex minimization
• Three-step method of gradient projection for minimization problems
• The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions
• Numerical behavior of the method of projection onto an acute cone with level control in convex minimization

Cites work

• scientific article; zbMATH DE number 3619637 (Why is no real title available?)
• scientific article; zbMATH DE number 194432 (Why is no real title available?)
• scientific article; zbMATH DE number 3894826 (Why is no real title available?)
• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
• A method of projection onto an acute cone with level control in convex minimization
• An Efficient Method to Solve the Minimax Problem Directly
• Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems
• New variants of bundle methods
• Numerical behavior of the method of projection onto an acute cone with level control in convex minimization
• Obtuse cones and Gram matrices with non-negative inverse
• 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
• Variable target value subgradient method

Cited in

(9)

• A generalized projection-based scheme for solving convex constrained optimization problems
• Numerical behavior of the method of projection onto an acute cone with level control in convex minimization
• Reflection-projection method for convex feasibility problems with an obtuse cone
• An extended projected residual algorithm for solving smooth convex optimization problems
• Approximate level method for nonsmooth convex minimization
• An algorithm accelerating the procedure of residual selection in sorting and solving inverse problems
• Variable target value relaxed alternating projection method
• Projection methods for the linear split feasibility problems
• Superiorization with level control

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4430670)