Convex analysis and monotone operator theory in Hilbert spaces
From MaRDI portal
Publication:5894170
DOI10.1007/978-1-4419-9467-7zbMath1218.47001OpenAlexW4229650096WikidataQ63347260 ScholiaQ63347260MaRDI QIDQ5894170
Heinz H. Bauschke, Patrick L. Combettes
Publication date: 21 March 2011
Published in: CMS Books in Mathematics/Ouvrages de Mathématiques de la SMC (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4419-9467-7
Convex programming (90C25) Nonlinear programming (90C30) Monotone operators and generalizations (47H05) Hilbert and pre-Hilbert spaces: geometry and topology (including spaces with semidefinite inner product) (46C05) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Convex functions and convex programs in convex geometry (52A41) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Research exposition (monographs, survey articles) pertaining to operator theory (47-02) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Convexity of real functions of several variables, generalizations (26B25)
Related Items (only showing first 100 items - show all)
An inertial Mann algorithm for nonexpansive mappings ⋮ A residual algorithm for finding a fixed point of a nonexpansive mapping ⋮ Modified Tseng's extragradient algorithms for variational inequality problems ⋮ Tseng type methods for solving inclusion problems and its applications ⋮ Self-adaptive inertial single projection methods for variational inequalities involving non-Lipschitz and Lipschitz operators with their applications to optimal control problems ⋮ Sharp convergence rates for averaged nonexpansive maps ⋮ Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm ⋮ Hybrid proximal linearized algorithm for the split DC program in infinite-dimensional real Hilbert spaces ⋮ An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems ⋮ Comparison theorem for viability kernels via conic preorders ⋮ Convergence of a randomized Douglas-Rachford method for linear system ⋮ A fully stochastic primal-dual algorithm ⋮ Proximal point algorithm for inclusion problems in Hadamard manifolds with applications ⋮ Quasi-relative interiors for graphs of convex set-valued mappings ⋮ New qualification conditions for convex optimization without convex representation ⋮ Randomized progressive hedging methods for multi-stage stochastic programming ⋮ Continuous dynamics related to monotone inclusions and non-smooth optimization problems ⋮ Nonsmoothness in machine learning: specific structure, proximal identification, and applications ⋮ A self-adaptive algorithm for split null point problems and fixed point problems for demicontractive multivalued mappings ⋮ Solving a split feasibility problem by the strong convergence of two projection algorithms in Hilbert spaces ⋮ Error analysis on Hérmite learning with gradient data ⋮ A note on the Douglas-Rachford splitting method for optimization problems involving hypoconvex functions ⋮ An inertial-like proximal algorithm for equilibrium problems ⋮ The projection and contraction methods for finding common solutions to variational inequality problems ⋮ On the weak topology of quaternionic Hilbert spaces ⋮ Epi-convergence: the Moreau envelope and generalized linear-quadratic functions ⋮ Local convergence of the heavy-ball method and iPiano for non-convex optimization ⋮ Implicit error bounds for Picard iterations on Hilbert spaces ⋮ A simplified view of first order methods for optimization ⋮ A fast algorithm for deconvolution and Poisson noise removal ⋮ Note on the modified relaxation CQ algorithm for the split feasibility problem ⋮ Approaching nonsmooth nonconvex optimization problems through first order dynamical systems with hidden acceleration and Hessian driven damping terms ⋮ Perspective functions: properties, constructions, and examples ⋮ Solving graph coloring problems with the Douglas-Rachford algorithm ⋮ Existence, stability and optimality for optimal control problems governed by maximal monotone operators ⋮ An inertial forward-backward algorithm for monotone inclusions ⋮ iPiasco: inertial proximal algorithm for strongly convex optimization ⋮ The structure of optimal parameters for image restoration problems ⋮ Approaching the solving of constrained variational inequalities via penalty term-based dynamical systems ⋮ Monotonicity beyond Minty and Kato on locally convex spaces ⋮ Noisy 1-bit compressive sensing: models and algorithms ⋮ Iterative methods for solving variational inequalities in Euclidean space ⋮ AAR-based decomposition algorithm for non-linear convex optimisation ⋮ Structural properties of extended normed spaces ⋮ Ubiquitous subdifferentials, \(r_L\)-density and maximal monotonicity ⋮ Convergence of the modified extragradient method for variational inequalities with non-Lipschitz operators ⋮ There is no variational characterization of the cycles in the method of periodic projections ⋮ The optimal value and optimal solutions of the proximal average of convex functions ⋮ Message-passing algorithms for inference and optimization ⋮ Iterative method with inertial for variational inequalities in Hilbert spaces ⋮ A Lyapunov-type approach to convergence of the Douglas-Rachford algorithm for a nonconvex setting ⋮ Variable quasi-Bregman monotone sequences ⋮ On optimal partitions, individual values and cooperative games: does a wiser agent always produce a higher value? ⋮ Smooth strongly convex interpolation and exact worst-case performance of first-order methods ⋮ Numerical methods for solving some matrix feasibility problems ⋮ Convergence properties of dynamic string-averaging projection methods in the presence of perturbations ⋮ An algorithm for a class of split feasibility problems: application to a model in electricity production ⋮ Parallel hybrid methods for generalized equilibrium problems and asymptotically strictly pseudocontractive mappings ⋮ A three-operator splitting scheme and its optimization applications ⋮ A new projection method for finding the closest point in the intersection of convex sets ⋮ Gradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data ⋮ Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings ⋮ An inertial proximal-gradient penalization scheme for constrained convex optimization problems ⋮ Weak versus strong convergence of a regularized Newton dynamic for maximal monotone operators ⋮ Strong convergence of an extragradient-type algorithm for the multiple-sets split equality problem ⋮ Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization ⋮ Decomposition methods for a spatial model for long-term energy pricing problem ⋮ A dynamical system associated with the fixed points set of a nonexpansive operator ⋮ Adaptive smoothing algorithms for nonsmooth composite convex minimization ⋮ Epi-convergence properties of smoothing by infimal convolution ⋮ Stability of saddle points via explicit coderivatives of pointwise subdifferentials ⋮ Nonconvex nonsmooth optimization via convex-nonconvex majorization-minimization ⋮ A variational approach to optical flow estimation of unsteady incompressible flows ⋮ Construction of pathological maximally monotone operators on non-reflexive Banach spaces ⋮ Proximity for sums of composite functions ⋮ ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem ⋮ Approximating endpoints of multi-valued nonexpansive mappings in Banach spaces ⋮ Proximal algorithms and temporal difference methods for solving fixed point problems ⋮ Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators ⋮ The generalized proximal point algorithm with step size 2 is not necessarily convergent ⋮ A convergent relaxation of the Douglas-Rachford algorithm ⋮ Algorithms based on unions of nonexpansive maps ⋮ Characterization of the equivalence of robustification and regularization in linear and matrix regression ⋮ A class of customized proximal point algorithms for linearly constrained convex optimization ⋮ A \(\mathcal O(1/k^{3/2})\) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems ⋮ Lagrangian penalization scheme with parallel forward-backward splitting ⋮ A strongly convergent primal-dual method for nonoverlapping domain decomposition ⋮ Dynamical behavior of a stochastic forward-backward algorithm using random monotone operators ⋮ Over relaxed hybrid proximal extragradient algorithm and its application to several operator splitting methods ⋮ Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization ⋮ Fast proximity-gradient algorithms for structured convex optimization problems ⋮ Multiplicative noise removal in imaging: an exp-model and its fixed-point proximity algorithm ⋮ Forward-backward and Tseng's type penalty schemes for monotone inclusion problems ⋮ A class of generalized monotone operators ⋮ A non-squeezing theorem for convex symplectic images of the Hilbert ball ⋮ Convex relaxations of penalties for sparse correlated variables with bounded total variation ⋮ On the convergence rate of Douglas-Rachford operator splitting method ⋮ Viscosity iterative techniques for approximating a common zero of monotone operators in an Hadamard space ⋮ Application of a new accelerated algorithm to regression problems ⋮ Parseval proximal neural networks
This page was built for publication: Convex analysis and monotone operator theory in Hilbert spaces
