A method of projection onto an acute cone with level control in convex minimization

DOI10.1007/s101070050068zbMath0973.90057MaRDI QIDQ1586207

Andrzej Cegielski

Publication date: 12 November 2000

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070050068

zbMATH Keywords

projection method; obtuse cone; acute cone; convex nondifferentiable minimization

Mathematics Subject Classification ID

90C25: Convex programming

90C30: Nonlinear programming

49J30: Existence of optimal solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.)

65F10: Iterative numerical methods for linear systems

Related Items

Residual Selection in A Projection Method for Convex Minimization Problems, Obtuse cones and Gram matrices with non-negative inverse, Approximate level method for nonsmooth convex minimization, Variable target value relaxed alternating projection method, Asymptotics for some proximal-like method involving inertia and memory aspects, Reflection-projection method for convex feasibility problems with an obtuse cone, How to project onto an isotone projection cone, The Newton Bracketing Method for Convex Minimization: Convergence Analysis, Cases of ineffectiveness of geometric cuts in sequential projection methods, Projection methods for the linear split feasibility problems