Single-projection procedure for infinite dimensional convex optimization problems

DOI10.1137/22M1530173MaRDI QIDQ6542543zbMATH OpenFDO

Authors Hoa T. Bui, R. S. Burachik, Evgeni A. Nurminski, Matthew K. Tam

Publication date 22 May 2024

Published in SIAM Journal on Optimization (Search for Journal in Brave)

zbMATH Keywords

linear programmingHilbert spaceconvex programmingprojection methodsubtransversalitysharpness propertypolytopes and polyhedral sets

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53)

Recommendations

• Single-projection procedure for linear optimization
• On convex feasibility problems
• Convex projection and convex multi-objective optimization
• A class of methods for projection on a convex set
• Finite termination of the proximal point algorithm in Banach spaces

Cites work

• A note on the finite convergence of alternating projections
• About subtransversality of collections of sets
• Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
• Continuity properties for the subdifferential and \(\varepsilon\)-subdifferential of a convex function and its conjugate
• Convex analysis and monotone operator theory in Hilbert spaces
• Convex proximal bundle methods in depth: a unified analysis for inexact oracles
• Fenchel duality in infinite-dimensional setting and its applications.
• From error bounds to the complexity of first-order descent methods for convex functions
• Functional analysis, Sobolev spaces and partial differential equations
• Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
• Nonsmooth analysis
• On the variational principle
• Random function iterations for consistent stochastic feasibility
• Regularities and their relations to error bounds
• Set-valued mappings and enlargement of monotone operators.
• Single-projection procedure for linear optimization
• The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
• Transversality and alternating projections for nonconvex sets

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)