On a proximal point method for convex optimization in banach spaces

DOI10.1080/01630569708816788zbMath0891.49002OpenAlexW1973808949MaRDI QIDQ4385279

Dan Butnariu, Alfredo Noel Iusem

Publication date: 12 July 1998

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

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

zbMATH Keywords

uniformly convex Banach spacesBochner integralBregman distanceconvex optimization problemsparallel proximal point methodtotally convex functions

Mathematics Subject Classification ID

Methods involving semicontinuity and convergence; relaxation (49J45) Existence theories for problems in abstract spaces (49J27)

Related Items (14)

Proximal projection methods for variational inequalities and Cesáro averaged approximations ⋮ Proximal Methods with Penalization Effects in Banach Spaces ⋮ Approximate proximal methods in vector optimization ⋮ Proximal methods in reflexive Banach spaces without monotonicity ⋮ Hybrid approximate proximal method with auxiliary variational inequality for vector optimization ⋮ Dykstras algorithm with bregman projections: A convergence proof ⋮ A strongly convergent hybrid proximal method in Banach spaces. ⋮ Generalized proximal point algorithms for multiobjective optimization problems ⋮ INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES ⋮ Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces ⋮ A proximal point method in nonreflexive Banach spaces ⋮ On a generalized proximal point method for solving equilibrium problems in Banach spaces ⋮ Inexact Proximal Point Methods for Equilibrium Problems in Banach Spaces ⋮ Strong Convergence of an Inexact Proximal Point Algorithm for Equilibrium Problems in Banach Spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Convex functions, monotone operators and differentiability.
• Auxiliary problem principle and decomposition of optimization problems
• The non-existence of smooth demand in general Banach spaces
• An iterative row-action method for interval convex programming
• Proximal minimization algorithm with \(D\)-functions
• A proximal point method for nonsmooth convex optimization problems in Banach spaces
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Monotone Operators and the Proximal Point Algorithm
• A mixed Hölder and Minkowski inequality
• Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
• On mixed Hölder-Minkowski inequalities and total convexity of certain functions in ℒ^p(Ω)
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
• Nonlinear equations of evolution and nonlinear accretive operators in Banach spaces

This page was built for publication: On a proximal point method for convex optimization in banach spaces