Non-Convex feasibility problems and proximal point methods (Q4673320)

From MaRDI portal

Revision as of 09:44, 10 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article; zbMATH DE number 2162913

Language	Label	Description	Also known as
English	Non-Convex feasibility problems and proximal point methods	scientific article; zbMATH DE number 2162913

Statements

scholarly article

0 references

Non-Convex feasibility problems and proximal point methods (English)

0 references

Jean-Noël Corvellec

0 references

Sjur Didrik Flåm

0 references

Optimization Methods and Software

0 references

publication date

29 April 2005

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/10556780410001654223

0 references

Metric and Generalized Projection Operators in Banach Spaces: Properties and Applications

0 references

Disjunctive Programming

0 references

Dykstra's alternating projection algorithm for two sets

0 references

On Projection Algorithms for Solving Convex Feasibility Problems

0 references

0 references

Partial Proximal Minimization Algorithms for Convex Pprogramming

0 references

Technical efficiency and distance to a reverse convex set

0 references

Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems

0 references

Strong convergence of expected-projection methods in hilbert spaces

0 references

Inherently parallel algorithms in feasibility and optimization and their applications. Research workshop, Haifa, Israel, March 13--16, 2000

0 references

Totally convex functions for fixed points computation and infinite dimensional optimization

0 references

An iterative row-action method for interval convex programming

0 references

Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization

0 references

Proximal minimization algorithm with \(D\)-functions

0 references

Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions

0 references

Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming

0 references

On the variational principle

0 references

Relaxed outer projections, weighted averages and convex feasibility

0 references

Successive Averages of Firmly Nonexpansive Mappings

0 references

Equilibrium programming using proximal-like algorithms

0 references

Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming

0 references

Generalized Bregman projections in convex feasibility problems

0 references

Duality in Reverse Convex Optimization

0 references

Monotone Operators and the Proximal Point Algorithm

0 references

Entropic Proximal Mappings with Applications to Nonlinear Programming

0 references

On the Convergence of the Products of Firmly Nonexpansive Mappings

0 references

Identifiers

zbMATH Open document ID

0 references

10.1080/10556780410001654223

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4673320

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4673320&oldid=34395392"