A method of projection onto an acute cone with level control in convex minimization
From MaRDI portal
Publication:1586207
DOI10.1007/s101070050068zbMath0973.90057OpenAlexW1978593101MaRDI QIDQ1586207
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
Convex programming (90C25) Nonlinear programming (90C30) Existence of optimal solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49J30) Iterative numerical methods for linear systems (65F10)
Related Items (14)
The Newton Bracketing Method for Convex Minimization: Convergence Analysis ⋮ Two iterative processes generated by regular vector fields in Banach spaces ⋮ Variable target value relaxed alternating projection method ⋮ Approximate level method for nonsmooth convex minimization ⋮ Projection methods for the linear split feasibility problems ⋮ Asymptotics for some proximal-like method involving inertia and memory aspects ⋮ Descent methods with computational errors in Banach spaces ⋮ How to project onto an isotone projection cone ⋮ Reflection-projection method for convex feasibility problems with an obtuse cone ⋮ Obtuse cones and Gram matrices with non-negative inverse ⋮ A generalized projection-based scheme for solving convex constrained optimization problems ⋮ Residual Selection in A Projection Method for Convex Minimization Problems ⋮ Unnamed Item ⋮ Cases of ineffectiveness of geometric cuts in sequential projection methods
This page was built for publication: A method of projection onto an acute cone with level control in convex minimization
