Non-Convex feasibility problems and proximal point methods

DOI10.1080/10556780410001654223zbMath1074.90555OpenAlexW2088236369MaRDI QIDQ4673320

Jean-Noël Corvellec, Sjur Didrik Flåm

Publication date: 29 April 2005

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780410001654223

Mathematics Subject Classification ID

Convex programming (90C25) Set-valued and variational analysis (49J53)

Related Items (3)

On the sensitivity of a Euclidean projection ⋮ A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems ⋮ Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods

Cites Work

• Unnamed Item
• Relaxed outer projections, weighted averages and convex feasibility
• An iterative row-action method for interval convex programming
• Proximal minimization algorithm with \(D\)-functions
• Dykstra's alternating projection algorithm for two sets
• Equilibrium programming using proximal-like algorithms
• Generalized Bregman projections in convex feasibility problems
• Totally convex functions for fixed points computation and infinite dimensional optimization
• Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems
• Technical efficiency and distance to a reverse convex set
• On the variational principle
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• On the Convergence of the Products of Firmly Nonexpansive Mappings
• Entropic Proximal Mappings with Applications to Nonlinear Programming
• Monotone Operators and the Proximal Point Algorithm
• Disjunctive Programming
• Duality in Reverse Convex Optimization
• Partial Proximal Minimization Algorithms for Convex Pprogramming
• Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• On Projection Algorithms for Solving Convex Feasibility Problems
• Strong convergence of expected-projection methods in hilbert spaces
• Successive Averages of Firmly Nonexpansive Mappings
• Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
• Metric and Generalized Projection Operators in Banach Spaces: Properties and Applications
• Inherently parallel algorithms in feasibility and optimization and their applications. Research workshop, Haifa, Israel, March 13--16, 2000

This page was built for publication: Non-Convex feasibility problems and proximal point methods