Proximité et dualité dans un espace hilbertien

DOI10.24033/BSMF.1625zbMath0136.12101OpenAlexW1953936588MaRDI QIDQ5510284

No author found.

Publication date: 1965

Published in: Bulletin de la Société mathématique de France (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=BSMF_1965__93__273_0

zbMATH Keywords

functional analysis

Related Items (only showing first 100 items - show all)

Well-posedness of approximation and optimization problems for weakly convex sets and functions ⋮ Convergence of proximal algorithms with stepsize controls for non-linear inverse problems and application to sparse non-negative matrix factorization ⋮ On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems ⋮ On how to solve large-scale log-determinant optimization problems ⋮ Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions ⋮ On some steplength approaches for proximal algorithms ⋮ Moreau-Yosida regularization of Lagrangian-dual functions for a class of convex optimization problems ⋮ The NSLUC property and Klee envelope ⋮ The piecewise linear-quadratic model for computational convex analysis ⋮ A dual method for minimizing a nonsmooth objective over one smooth inequality constraint ⋮ Convergence rates with inexact non-expansive operators ⋮ Algorithms for overcoming the curse of dimensionality for certain Hamilton-Jacobi equations arising in control theory and elsewhere ⋮ A new algorithm for linearly constrained c-convex vector optimization with a supply chain network risk application ⋮ Global convergence of a proximal linearized algorithm for difference of convex functions ⋮ Nonlinear spectral analysis via one-homogeneous functionals: overview and future prospects ⋮ Maximum entropy methods as the bridge between microscopic and macroscopic theory ⋮ Nonlinear rescaling as interior quadratic prox method in convex optimization ⋮ Near equality, near convexity, sums of maximally monotone operators, and averages of firmly nonexpansive mappings ⋮ Computing the conjugate of convex piecewise linear-quadratic bivariate functions ⋮ Moreau's decomposition in Banach spaces ⋮ Fitzpatrick functions, cyclic monotonicity and Rockafellar's antiderivative ⋮ On a system of extended general variational inclusions ⋮ Fast Moreau envelope computation I: Numerical algorithms ⋮ New conjugacy condition and related new conjugate gradient methods for unconstrained optimization ⋮ Iterative approximation of a unique solution of a system of variational-like inclusions in real \(q\)-uniformly smooth Banach spaces ⋮ Nonlinear multilayered representation of graph-signals ⋮ Convex relaxation algorithm for a structured simultaneous low-rank and sparse recovery problem ⋮ Extended forward-backward algorithm ⋮ An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming ⋮ An inertial forward-backward algorithm for monotone inclusions ⋮ Dualization of signal recovery problems ⋮ Minimizing irregular convex functions: Ulam stability for approximate minima ⋮ Convex hull algorithms for piecewise linear-quadratic functions in computational convex analysis ⋮ Operator splittings, Bregman methods and frame shrinkage in image processing ⋮ A multi-scale vectorial \(L^{\tau }\)-TV framework for color image restoration ⋮ An approximate proximal point algorithm for maximal monotone inclusion problems ⋮ A decomposition algorithm for convex nondifferentiable minimization with errors ⋮ A proximal point algorithm for DC functions on Hadamard manifolds ⋮ Composition duality methods for quasistatic evolution elastoviscoplastic variational problems ⋮ Noisy 1-bit compressive sensing: models and algorithms ⋮ Convexity of the proximal average ⋮ Firmly nonexpansive mappings and maximally monotone operators: correspondence and duality ⋮ An implementable proximal point algorithmic framework for nuclear norm minimization ⋮ An interior proximal method in vector optimization ⋮ Maximal monotone operators and the proximal point algorithm in the presence of computational errors ⋮ A projection-proximal point algorithm for solving generalized variational inequalities ⋮ Convergence of a proximal point algorithm for solving minimization problems ⋮ A proximal point algorithm for finding a common zero of a finite family of maximal monotone operators in the presence of computational errors ⋮ Algorithms for solving system of extended general variational inclusions and fixed points problems ⋮ Canonical and anti-canonical transformations preserving convexity of potentials ⋮ The Moreau envelope function and proximal mapping in the sense of the Bregman distance ⋮ A characterization of essentially strictly convex functions on reflexive Banach spaces ⋮ Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function ⋮ A stable method solving the total variation dictionary model with \(L^\infty\) constraints ⋮ Weighted-average alternating minimization method for magnetic resonance image reconstruction based on compressive sensing ⋮ Convex sweeping process in the framework of measure differential inclusions and evolution variational inequalities ⋮ Applications of convex analysis within mathematics ⋮ Dual subgradient algorithms for large-scale nonsmooth learning problems ⋮ Comments on ``The proximal point algorithm revisited ⋮ Finite termination of inexact proximal point algorithms in Hilbert spaces ⋮ Generalized inexact proximal algorithms: routine's formation with resistance to change, following worthwhile changes ⋮ A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality ⋮ Primal-dual algorithm based on Gauss-Seidel scheme with application to multiplicative noise removal ⋮ A partial proximal point algorithm for nuclear norm regularized matrix least squares problems ⋮ Variable quasi-Bregman monotone sequences ⋮ On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery ⋮ Primal and dual predicted decrease approximation methods ⋮ On the impact of predictor geometry on the performance on high-dimensional ridge-regularized generalized robust regression estimators ⋮ Inexact proximal Newton methods for self-concordant functions ⋮ Approximation and regularization of arbitrary functions in Hilbert spaces by the Lasry-Lions method ⋮ Epi-convergence properties of smoothing by infimal convolution ⋮ Proximity for sums of composite functions ⋮ Compositions and averages of two resolvents: relative geometry of fixed points sets and a partial answer to a question by C.\,Byrne ⋮ The asymptotic behavior of the composition of two resolvents ⋮ Deconvolution under Poisson noise using exact data fidelity and synthesis or analysis sparsity priors ⋮ The generalized proximal point algorithm with step size 2 is not necessarily convergent ⋮ Partial inverse of a monotone operator ⋮ Sparse \(\ell_ {1}\) regularisation of matrix valued models for acoustic source characterisation ⋮ Well posedness and inf-convolution ⋮ A block coordinate variable metric forward-backward algorithm ⋮ Existence and iterative approximation of solutions of a system of general variational inclusions ⋮ Sparse regression using mixed norms ⋮ Iterative processes of Fejér type in ill-posed problems with a priori information ⋮ Properties and iterative methods for the lasso and its variants ⋮ Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach ⋮ Generalized row-action methods for tomographic imaging ⋮ On the convergence rate of Douglas-Rachford operator splitting method ⋮ Familles d'opérateurs maximaux monotones et mesurabilite ⋮ Inexact proximal point methods in metric spaces ⋮ Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization ⋮ Parseval proximal neural networks ⋮ On the use of KKM multifunctions in fixed point theory and related topics ⋮ Diffusion equation for multivalued stochastic differential equations ⋮ Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data ⋮ Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications ⋮ Subdifferentiation of regularized functions ⋮ A fast edge detection algorithm using binary labels ⋮ Finite composite games: equilibria and dynamics ⋮ Relaxation approximation of Friedrichs' systems under convex constraints ⋮ General viscosity iterative approximation for solving unconstrained convex optimization problems

Cites Work

• Monotone (nonlinear) operators in Hilbert space
• On the solvability of nonlinear functional equations of 'monotonic' type
• Inf-convolution, sous-additivite, convexite des fonctions numériques
• On the monotonicity of the gradient of a convex function
• The closure of the numerical range contains the spectrum
• Multi-Valued Monotone Nonlinear Mappings and Duality Mappings in Banach Spaces
• On the Subdifferentiability of Convex Functions
• Duality theorems for convex functions
• ON A „MONOTONICITY” METHOD FOR THE SOLUTION OF NONLINEAR EQUATIONS IN BANACH SPACES
• The method of the hypercircle in function-space for boundary-value problems
• Approximations in elasticity based on the concept of function space
• On Conjugate Convex Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Proximité et dualité dans un espace hilbertien