Non-Convex feasibility problems and proximal point methods
From MaRDI portal
Recommendations
- Proximal point methods and nonconvex optimization
- Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
- Fixed point algorithms for nonconvex feasibility with applications
- Proximal point algorithms and generalized nonlinear variational problems
- A class of nonlinear proximal point algorithms for variational inequality problems
- Nonlinear proximal decomposition method for convex programming
- Computing proximal points of nonconvex functions
- Approximation to nonproper problems of convex programming
- The proximal point method for nonmonotone variational inequalities
- Application of the proximal point method to nonmonotone equilibrium problems
Cites work
- An iterative row-action method for interval convex programming
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
- Disjunctive Programming
- Duality in Reverse Convex Optimization
- Dykstra's alternating projection algorithm for two sets
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Equilibrium programming using proximal-like algorithms
- Generalized Bregman projections in convex feasibility problems
- Inherently parallel algorithms in feasibility and optimization and their applications. Research workshop, Haifa, Israel, March 13--16, 2000
- Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
- Metric and Generalized Projection Operators in Banach Spaces: Properties and Applications
- Monotone Operators and the Proximal Point Algorithm
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the Convergence of the Products of Firmly Nonexpansive Mappings
- On the variational principle
- Partial Proximal Minimization Algorithms for Convex Pprogramming
- Projection algorithms: Results and open problems
- Proximal minimization algorithm with \(D\)-functions
- Relaxed outer projections, weighted averages and convex feasibility
- Strong convergence of expected-projection methods in hilbert spaces
- Successive Averages of Firmly Nonexpansive Mappings
- Technical efficiency and distance to a reverse convex set
- Totally convex functions for fixed points computation and infinite dimensional optimization
Cited in
(9)- Proximal point methods and nonconvex optimization
- A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems
- A linearly convergent algorithm for solving a class of nonconvex/affine feasibility problems
- On the sensitivity of a Euclidean projection
- Distributed solutions for loosely coupled feasibility problems using proximal splitting methods
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
- scientific article; zbMATH DE number 7195209 (Why is no real title available?)
- The landscape of the proximal point method for nonconvex-nonconcave minimax optimization
- Computing proximal points of nonconvex functions
This page was built for publication: Non-Convex feasibility problems and proximal point methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4673320)
