Single-projection procedure for infinite dimensional convex optimization problems
From MaRDI portal
Publication:6542543
DOI10.1137/22M1530173zbMATH Open1547.90114MaRDI QIDQ6542543FDOQ6542543
Matthew K. Tam, Evgeni A. Nurminski, R. S. Burachik, Hoa T. Bui
Publication date: 22 May 2024
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
linear programmingHilbert spaceconvex programmingprojection methodsubtransversalitysharpness propertypolytopes and polyhedral sets
Convex programming (90C25) Linear programming (90C05) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53)
Cites Work
- Title not available (Why is that?)
- Functional analysis, Sobolev spaces and partial differential equations
- On the variational principle
- Set-valued mappings and enlargement of monotone operators.
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Nonsmooth analysis
- The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
- Convex analysis and monotone operator theory in Hilbert spaces
- Random Function Iterations for Consistent Stochastic Feasibility
- Single-projection procedure for linear optimization
- Fenchel duality in infinite-dimensional setting and its applications.
- Transversality and alternating projections for nonconvex sets
- From error bounds to the complexity of first-order descent methods for convex functions
- Regularities and their relations to error bounds
- About subtransversality of collections of sets
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- A note on the finite convergence of alternating projections
- Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
This page was built for publication: Single-projection procedure for infinite dimensional convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6542543)
