Proximité et dualité dans un espace hilbertien

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

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

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, Variational analysis of the Ky Fan $k$-norm, Forward-backward quasi-Newton methods for nonsmooth optimization problems, Total variation image deblurring with space-varying kernel, Guaranteed deterministic approach to superhedging: a numerical experiment, Fixed point algorithm based on adapted metric method for convex minimization problem with application to image deblurring, An accelerated coordinate gradient descent algorithm for non-separable composite optimization, A modified Dai-Liao conjugate gradient method for solving unconstrained optimization and image restoration problems, Proximal methods avoid active strict saddles of weakly convex functions, An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems, Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints, Optimal complexity and certification of Bregman first-order methods, A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization, On Hamilton-Jacobi PDEs and image denoising models with certain nonadditive noise, On the resolution of the variational inequalities of the first and the second kind as equations obtained by explicit Moreau-Yosida regularizations, The developments of proximal point algorithms, On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function, High-dimensional change-point estimation: combining filtering with convex optimization, Nonconvex and nonsmooth optimization with generalized orthogonality constraints: an approximate augmented Lagrangian method, Existence and uniqueness of the solution for stochastic super-fast diffusion equations with multiplicative noise, Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators, The springback penalty for robust signal recovery, Inner regularizations and viscosity solutions for pessimistic bilevel optimization problems, Strong convergence of a general iterative algorithm for a finite family of accretive operators in Banach spaces, A hybrid quasi-Newton projected-gradient method with application to lasso and basis-pursuit denoising, Iterative methods based on soft thresholding of hierarchical tensors, Theoretical aspect of diagonal Bregman proximal methods, Approximation of zeros of accretive operators in a Banach space, Splitting extragradient-like algorithms for strongly pseudomonotone equilibrium problems, A globally linearly convergent method for pointwise quadratically supportable convex-concave saddle point problems, Regularization in Banach spaces with respect to the Bregman distance, Inexact first-order primal-dual algorithms, On Douglas-Rachford operators that fail to be proximal mappings, Spectral operators of matrices, Computing proximal points of convex functions with inexact subgradients, Tracking the solution of a linear parabolic equation using feedback laws, Projective method of multipliers for linearly constrained convex minimization, A parameterized Douglas-Rachford algorithm, A nonconvex model with minimax concave penalty for image restoration, tSSNALM: a fast two-stage semi-smooth Newton augmented Lagrangian method for sparse CCA, A new interpretation of the progressive hedging algorithm for multistage stochastic minimization problems, The multiproximal linearization method for convex composite problems, Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs, Weighted nuclear norm minimization and its applications to low level vision, Algorithm for solutions of nonlinear equations of strongly monotone type and applications to convex minimization and variational inequality problems, A characterization of proximity operators, Hybrid inertial accelerated algorithms for split fixed point problems of demicontractive mappings and equilibrium problems, Iterative Fejér processes in ill-posed problems, Proximity point algorithm for low-rank matrix recovery from sparse noise corrupted data, An algorithm for the split feasible problem and image restoration, Algorithm for overcoming the curse of dimensionality for state-dependent Hamilton-Jacobi equations, Differential properties of the Moreau envelope, On fixed point approach to equilibrium problem, Sensitivity analysis of maximally monotone inclusions via the proto-differentiability of the resolvent operator, Lipschitz continuity of convex functions, Accelerated proximal point method for maximally monotone operators, Determination of convex functions via subgradients of minimal norm, Convolutional proximal neural networks and plug-and-play algorithms, Compensated convexity on bounded domains, mixed Moreau envelopes and computational methods, The proximal point algorithm revisited, Performance of first-order methods for smooth convex minimization: a novel approach, A framelet-based image inpainting algorithm, Smoothness of boundaries of regular sets, Implementation of an elastoplastic solver based on the Moreau-Yosida theorem, A TV based restoration model with local constraints, Projective splitting methods for sums of maximal monotone operators with applications, Sparse trace norm regularization, Weiszfeld's method: old and new results, A proximal-point SQP trust region method for solving some special class of nonlinear semi-definite programming problems, A new relative error criterion for the proximal point algorithm, Extension theorems for vector valued maps, The resolvent average for positive semidefinite matrices, A proximal point method in nonreflexive Banach spaces, On starting and stopping criteria for nested primal-dual iterations, Structured sparsity promoting functions, Subgame perfect Nash equilibrium: a learning approach via costs to move, Solution refinement at regular points of conic problems, A variable metric proximal-descent algorithm for monotone operators, Nesterov's algorithm solving dual formulation for compressed sensing, Existence results of partial differential mixed variational inequalities without Lipschitz continuity, Accelerated proximal incremental algorithm schemes for non-strongly convex functions, A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems, Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity, On the convergence of a multigrid method for Moreau-regularized variational inequalities of the second kind, A new generalized projection and its application to acceleration of audio declipping, Deep relaxation: partial differential equations for optimizing deep neural networks, Well-posedness of nonsmooth Lurie dynamical systems involving maximal monotone operators, On the local convergence of a stochastic semismooth Newton method for nonsmooth nonconvex optimization, Optimization problems involving group sparsity terms, Variational convexity and the local monotonicity of subgradient mappings, Convergence results of two-step inertial proximal point algorithm, On a decomposition formula for the resolvent operator of the sum of two set-valued maps with monotonicity assumptions, A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems, Continuous Fréchet differentiability of the Moreau envelope of convex functions on Banach spaces, A variable smoothing algorithm for solving convex optimization problems, Data-driven gradient flows, Converting ADMM to a proximal gradient for efficient sparse estimation, A nested primal-dual FISTA-like scheme for composite convex optimization problems, Sparse regularization via bidualization, Sensitivity analysis of a scalar mechanical contact problem with perturbation of the Tresca's friction law, Approximation of an elastic rod with self-contact: impenetrable elastic rod, General parameterized proximal point algorithm with applications in statistical learning, An efficient semismooth Newton method for adaptive sparse signal recovery problems, The proximal point method with a vectorial Bregman regularization in multiobjective DC programming, Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization, Solving the OSCAR and SLOPE Models Using a Semismooth Newton-Based Augmented Lagrangian Method, Optimal Algorithms for Non-Smooth Distributed Optimization in Networks, Existence and perturbation theorems for nonlinear maximal monotone operators in Banach spaces, Order-preservation properties of resolvent operators and their applications to variational inequalities, On a decomposition formula for the proximal operator of the sum of two convex functions, Zeroth-Order Stochastic Compositional Algorithms for Risk-Aware Learning, Wasserstein-Based Projections with Applications to Inverse Problems, Graphical Convergence of Subgradients in Nonconvex Optimization and Learning, A Variable Sample-Size Stochastic Quasi-Newton Method for Smooth and Nonsmooth Stochastic Convex Optimization, The Bregman Proximal Average, Optimization of triangular networks with spatial constraints, On the linear convergence of a Bregman proximal point algorithm, Weak and linear convergence of a generalized proximal point algorithm with alternating inertial steps for a monotone inclusion problem, Unnamed Item, Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant, On the equivalence of statistical distances for isotropic convex measures, Closed-Form Expressions for Projectors onto Polyhedral Sets in Hilbert Spaces, An inertial viscosity algorithm for solving monotone variational inclusion and common fixed point problems of strict pseudocontractions, Low-rank tensor methods for partial differential equations, Distributionally robust unsupervised domain adaptation, A short note on the twice differentiability of the marginal function of a convex function, Some extensions of the operator splitting schemes based on Lagrangian and primal–dual: a unified proximal point analysis, Nonconvex evolution inclusions governed by the difference of two subdifferentials, Unnamed Item, Well-posedness and nonsmooth Lyapunov pairs for state-dependent maximal monotone differential inclusions, Bounded perturbation resilience and superiorization techniques for a modified proximal gradient method, Proximal determination of convex functions, ENVELOPES FOR SETS AND FUNCTIONS: REGULARIZATION AND GENERALIZED CONJUGACY, A Proximal Point Dual Newton Algorithm for Solving Group Graphical Lasso Problems, BV prox-regular sweeping process with bounded truncated variation, Inertial methods for fixed point problems and zero point problems of the sum of two monotone mappings, Penalization of Nonsmooth Dynamical Systems with Noise: Ergodicity and Asymptotic Formulae for Threshold Crossings Probabilities, An efficient augmented Lagrangian method for support vector machine, The Generalized Bregman Distance, Inexact primal–dual gradient projection methods for nonlinear optimization on convex set, Degenerate sweeping process with a Lipschitz perturbation, Functions on a convex set which are both $\omega$-semiconvex and $\omega$-semiconcave, The Resolvent Order: A Unification of the Orders by Zarantonello, by Loewner, and by Moreau, An introduction to continuous optimization for imaging, Unnamed Item, Perturbation resilience of proximal gradient algorithm for composite objectives, Sensitivity Analysis of Variational Inequalities via Twice Epi-differentiability and Proto-differentiability of the Proximity Operator, Local linear convergence analysis of Primal–Dual splitting methods, Convex Analysis and Optimization in the Past 50 Years: Some Snapshots, Techniques and Open Questions in Computational Convex Analysis, Primal Lower Nice Functions and Their Moreau Envelopes, Augmented Lagrangian methods for variational inequality problems, Stability analysis of Gauss-type proximal point method for metrically regular mappings, A new proof of the integrability of the subdifferential of a convex function on a Banach space, A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems, Preface, Data-Driven Nonsmooth Optimization, Essentials of numerical nonsmooth optimization, Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings, A Strong Convergence Theorem for an Iterative Method for Finding Zeros of Maximal Monotone Maps with Applications to Convex Minimization and Variational Inequality Problems, An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels, BinaryRelax: A Relaxation Approach for Training Deep Neural Networks with Quantized Weights, Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs, Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems, An efficient Peaceman–Rachford splitting method for constrained TGV-shearlet-based MRI reconstruction, SPARCOM: Sparsity Based Super-resolution Correlation Microscopy, Variable Metric Forward-Backward Algorithm for Composite Minimization Problems, Unnamed Item, A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization, An Efficient Linearly Convergent Regularized Proximal Point Algorithm for Fused Multiple Graphical Lasso Problems, Unnamed Item, Compensated convexity and Hausdorff stable geometric singularity extractions, Compensated convexity and Hausdorff stable extraction of intersections for smooth manifolds, Moreau Envelope of Supremum Functions with Applications to Infinite and Stochastic Programming, Optimal Diversification in the Presence of Parameter Uncertainty for a Risk Averse Investor, A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima, Equivariant neural networks for inverse problems, Algorithmic versatility of SPF-regularization methods, On the Convergence Rate of Inexact Majorized sGS ADMM with Indefinite Proximal Terms for Convex Composite Programming, Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework, Learning Maximally Monotone Operators for Image Recovery, Regularization by Denoising via Fixed-Point Projection (RED-PRO), On the Convergence Rate of Projected Gradient Descent for a Back-Projection Based Objective, Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction, Inexact High-Order Proximal-Point Methods with Auxiliary Search Procedure, Regularization and Approximation Methods in Stackelberg Games and Bilevel Optimization, Essentials of numerical nonsmooth optimization, Distributed Stochastic Inertial-Accelerated Methods with Delayed Derivatives for Nonconvex Problems, Sensitivity analysis of a Tresca-Type Problem leads to Signorini’s conditions, Efficient Sparse Hessian-Based Semismooth Newton Algorithms for Dantzig Selector, A Dimension Reduction Technique for Large-Scale Structured Sparse Optimization Problems with Application to Convex Clustering, Scaled, Inexact, and Adaptive Generalized FISTA for Strongly Convex Optimization, Smoothed Variable Sample-Size Accelerated Proximal Methods for Nonsmooth Stochastic Convex Programs, Learnable Empirical Mode Decomposition based on Mathematical Morphology, High-Dimensional Gaussian Sampling: A Review and a Unifying Approach Based on a Stochastic Proximal Point Algorithm, Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons, Reflection-based technique for synthesis of structured controllers with guaranteed local convergence, Proximal Gradient Methods for Machine Learning and Imaging, Fixed-point algorithms for a TVL1 image restoration model, Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization, Cosmic divergence, weak cosmic convergence, and fixed points at infinity, Graphical methods in first and second-order differentiability theory of integral functionals, Duality results and proximal solutions of the Huber $M$-estimator problem, A nonsmooth Newton method for variational inequalities. I: Theory, Duality and variational principles of potential boundary value problems, Proximal point methods for Lipschitz functions on Hadamard manifolds: scalar and vectorial cases, Links between functions and subdifferentials, Stochastic backward Euler: an implicit gradient descent algorithm for $k$-means clustering, Epi-convergence: the Moreau envelope and generalized linear-quadratic functions, Variable metric bundle methods: From conceptual to implementable forms, A simplified view of first order methods for optimization, Monotone operator theory in convex optimization, Probabilistic optimization via approximate $p$-efficient points and bundle methods, Nonlinear rescaling and proximal-like methods in convex optimization, Régularization S.C.I. et $\Gamma$-convergence: Approximations inf- convolutives associées à un référentiel. (L.S.C. regularization and $\Gamma$-convergence: Inf-convolutive approximation associated with a reference functional), Sparse estimation of high-dimensional correlation matrices, Supervised nonnegative matrix factorization via minimization of regularized Moreau-envelope of divergence function with application to music transcription, A fast dual proximal gradient algorithm for convex minimization and applications, A partially isochronous splitting algorithm for three-block separable convex minimization problems, Moreau's decomposition theorem revisited, Global probability maximization for a Gaussian bilateral inequality in polynomial time, Convergence analysis of a proximal Gauss-Newton method, Proximal algorithms for multicomponent image recovery problems, A spatial regularization approach for vector quantization, A fast fixed point algorithm for total variation deblurring and segmentation, Differentiability for Green's operators of variational inequalities and applications to the determination of bifurcation points, An accelerated inexact proximal point algorithm for convex minimization, Algorithm for overcoming the curse of dimensionality for time-dependent non-convex Hamilton-Jacobi equations arising from optimal control and differential games problems, Mixed quasi-variational inequalities involving error bounds, An additive subfamily of enlargements of a maximally monotone operator, Proximity algorithms for the L1/TV image denoising model, Generalization of the Trotter-Lie formula, The Shannon total variation, Merit functions and error bounds for generalized variational inequalities., Unbounded state-dependent sweeping processes with perturbations in uniformly convex and $q$-uniformly smooth Banach spaces, Optimisation of classic photometric stereo by non-convex variational minimisation, Projection and proximal point methods: Convergence results and counterexamples., Preconditioned ADMM for a class of bilinear programming problems, Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming, Nonconvex energy minimization and dislocation structures in ductile single crystals, On the convergence analysis of inexact hybrid extragradient proximal point algorithms for maximal monotone operators, A new piecewise quadratic approximation approach for $L_0$ norm minimization problem, Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs, Envelope functions: unifications and further properties, Numerical aspects of the sweeping process, Compensated convexity and its applications, Proximal-like algorithm using the quasi D-function for convex second-order cone programming, Visco-penalization of the sum of two monotone operators, On sums and convex combinations of projectors onto convex sets, A splitting algorithm for equilibrium problem given by the difference of two bifunctions, On the optimal linear convergence rate of a generalized proximal point algorithm, Linear convergence rates for variants of the alternating direction method of multipliers in smooth cases, Upper semismooth functions and the subdifferential determination property, How to regularize a difference of convex functions, On functionals with convex Carathéodory integrands with a linear growth condition, The forward-backward algorithm and the normal problem, Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness, Computing proximal points of nonconvex functions, Modified proximal point algorithm for extended linear-quadratic programming, Inertial alternating generalized forward-backward splitting for image colorization, Templates for convex cone problems with applications to sparse signal recovery, Neural network based on systematically generated smoothing functions for absolute value equation, Prox-regular functions in Hilbert spaces, Inexact proximal $\epsilon$-subgradient methods for composite convex optimization problems, Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis, Approximation of zeros of bounded maximal monotone mappings, solutions of Hammerstein integral equations and convex minimization problems, Properties and iterative methods for the $Q$-lasso, The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems, Point process estimation with Mirror Prox algorithms, Weak convergence of an extended splitting method for monotone inclusions, Convergence of convex integrals in $\mathcal P$ spaces, Asymptotic properties on high-dimensional multivariate regression M-estimation, A dual algorithm for the solution of nonlinear variational problems via finite element approximation, Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization, Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels, Rate of convergence analysis of dual-based variables decomposition methods for strongly convex problems, A simple algorithm for a class of nonsmooth convex-concave saddle-point problems, Globalized inexact proximal Newton-type methods for nonconvex composite functions, Differentiability and bifurcation points for a class of monotone nonlinear operators, A dual based semismooth Newton-type algorithm for solving large-scale sparse Tikhonov regularization problems, Generalized Krasnoselskii-Mann-type iteration for nonexpansive mappings in Banach spaces, Reconstruction of functions from prescribed proximal points, A parameterized proximal point algorithm for separable convex optimization, Double fused Lasso regularized regression with both matrix and vector valued predictors, Solving mixed variational inequalities beyond convexity, An efficient Hessian based algorithm for singly linearly and box constrained least squares regression, High-dimensional linear models: a random matrix perspective, On Bayesian posterior mean estimators in imaging sciences and Hamilton-Jacobi partial differential equations, Proximal mappings, A projection method for least-squares solutions to overdetermined systems of linear inequalities, New strong convergence method for the sum of two maximal monotone operators, Bregman primal-dual first-order method and application to sparse semidefinite programming, Low-rank matrix denoising for count data using unbiased Kullback-Leibler risk estimation, A numerical analysis of a class of contact problems with friction in elastostatics, A proximal iterative approach to a non-convex optimization problem, A propos de quelques opérateurs non linéaires, Un théorème de Sturm-Liouville pour une classe d'opérateurs non linéaires maximaux monotones, A primal-dual projection method for solving systems of linear inequalities, On the need for hybrid steps in hybrid proximal point methods, Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results, An accelerated proximal gradient method for multiobjective optimization, Old and new challenges in Hadamard spaces, The Semiconvex Regularization of Functions, A Zeroth-Order Proximal Stochastic Gradient Method for Weakly Convex Stochastic Optimization, An adaptive sampling augmented Lagrangian method for stochastic optimization with deterministic constraints, Shape Optimization for Variational Inequalities: The Scalar Tresca Friction Problem, Smoothing unadjusted Langevin algorithms for nonsmooth composite potential functions, A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem, Extension of forward-reflected-backward method to non-convex mixed variational inequalities, PAC-learning with approximate predictors, Determining functions by slopes, An accelerated tensorial double proximal gradient method for total variation regularization problem, Constrained composite optimization and augmented Lagrangian methods, A dual semismooth Newton based augmented Lagrangian method for large-scale linearly constrained sparse group square-root Lasso problems, Accelerated variance-reduced methods for saddle-point problems, A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds, No-regret algorithms in on-line learning, games and convex optimization, Sparse precision matrix estimation with missing observations, A class of one dimensional periodic microstructures exhibiting effective Timoshenko Beam behavior, Convergence Rate Analysis of Accelerated Forward-Backward Algorithm with Generalized Nesterov Momentum Scheme, Nonstationary online convex optimization with multiple predictions, A Positive and Moment-Preserving Fourier Spectral Method, Continuous time learning algorithms in optimization and game theory, Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm, An improved normal compliance method for dynamic hyperelastic problems with energy conservation property, A condition for the identification of multivariate models with binary instruments, Resolvent and proximal compositions, Convergence analysis of M-iteration for $\mathcal{G}$-nonexpansive mappings with directed graphs applicable in image deblurring and signal recovering problems, An elementary approach to tight worst case complexity analysis of gradient based methods, Principled analyses and design of first-order methods with inexact proximal operators, First-order methods for convex optimization, Stochastic variable metric proximal gradient with variance reduction for non-convex composite optimization, Strongly convergent inertial proximal point algorithm without on-line rule, Propagation of singularities of Moreau envelopes and distance functions in a Hilbert space, Convergence point of G-nonexpansive mappings in Banach spaces endowed with graphs applicable in image deblurring and signal recovering problems, Enlargements: a bridge between maximal monotonicity and convexity, Unnamed Item, Unnamed Item, Strict convex regularizations, proximal points and augmented lagrangians, Self-Dual Smooth Approximations of Convex Functions via the Proximal Average, Proximal Splitting Methods in Signal Processing, Graph-Matrix Calculus for Computational Convex Analysis, Existence and Approximation of Fixed Points of Bregman Firmly Nonexpansive Mappings in Reflexive Banach Spaces, Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings, A General Inertial Proximal Point Algorithm for Mixed Variational Inequality Problem, Nonsmooth convex optimization for structured illumination microscopy image reconstruction, Unnamed Item, A Preconditioner for A Primal-Dual Newton Conjugate Gradient Method for Compressed Sensing Problems, Inertial Proximal ADMM for Linearly Constrained Separable Convex Optimization, On Convex Finite-Dimensional Variational Methods in Imaging Sciences and Hamilton--Jacobi Equations, A Convex Approach for Image Restoration with Exact Poisson--Gaussian Likelihood, MULTISYMPLECTIC VARIATIONAL INTEGRATORS FOR NONSMOOTH LAGRANGIAN CONTINUUM MECHANICS, Compensated Convexity Methods for Approximations and Interpolations of Sampled Functions in Euclidean Spaces: Theoretical Foundations, Decomposition Methods for Sparse Matrix Nearness Problems, Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems, Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging, Firmly nonexpansive mappings in classes of geodesic spaces, Symmetric Duality for Structured Convex Programs, Non-convex sweeping processes involving maximal monotone operators, A Proximal Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming with Applications to Imaging, Regularizing with Bregman--Moreau Envelopes, Unnamed Item, On Bayesian estimation and proximity operators, Caractérisation de la convergence au sens de Mosco en terme d'approximations inf-convolutives, A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization, The Legendre Transformation in Modern Optimization, On robust regression with high-dimensional predictors, An accelerated variant of the projection based parallel hybrid algorithm for split null point problems, Resolvent of the parallel composition and the proximity operator of the infimal postcomposition, Inexact accelerated high-order proximal-point methods, Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm, A unified and tight linear convergence analysis of the relaxed proximal point algorithm, Prox-mappings associated with a pair of Legendre conjugate functions, An inertial proximal point method for difference of maximal monotone vector fields in Hadamard manifolds, Unnamed Item, Contraction of the proximal mapping and applications to the equilibrium problem, Dynamic SPECT reconstruction with temporal edge correlation, A generalization of the Moreau-Yosida regularization, Bregman three-operator splitting methods, Unnamed Item, Stochastic Model-Based Minimization of Weakly Convex Functions, Hybrid Moreau’s Proximal Algorithms and Convergence Theorems for Minimization Problems in Hilbert Spaces with Applications, Error Estimates for a Class of Elliptic Optimal Control Problems, An alternating direction method of multipliers with a worst-case $O(1/n^2)$ convergence rate, On the Use of ADMM for Imaging Inverse Problems: the Pros and Cons of Matrix Inversions, Prox-regularization of the dual method of centers for generalized fractional programs, Evolution Problems with Time-Dependent Subdifferential Operators, Tight Sublinear Convergence Rate of the Proximal Point Algorithm for Maximal Monotone Inclusion Problems, The Proximal Point Method for Locally Lipschitz Functions in Multiobjective Optimization with Application to the Compromise Problem, FOM – a MATLAB toolbox of first-order methods for solving convex optimization problems, On proximal mappings with Young functions in uniformly convex Banach spaces, Can we trust the bootstrap in high-dimension?, A new proximal point iteration that converges weakly but not in norm, An Extension of the Auxiliary Problem Principle to Nonsymmetric Auxiliary Operators, Second Order Differentiability of Convex Functions in Banach Spaces, A variational method for nonlinear multivalued operators, 16.—A Remark on a Paper by J. F. Toland and some Applications to Unilateral Problems, Unnamed Item, Isometries for the Legendre-Fenchel Transform, Duality and Convex Programming, Inertial Variable Metric Techniques for the Inexact Forward--Backward Algorithm, Analyse de récession et résultats de stabilité d'une convergence variationnelle, application à la théorie de la dualité en programmation mathématique, The Resolvent Average of Monotone Operators: Dominant and Recessive Properties, Unnamed Item, Preconditioning of a Generalized Forward-Backward Splitting and Application to Optimization on Graphs, Reprint of ``Nesterov's algorithm solving dual formulation for compressed sensing, Partial regularization of the sum of two maximal monotone operators, On convergence analysis of dual proximal-gradient methods with approximate gradient for a class of nonsmooth convex minimization problems, Iterative algorithm for zeros of multivalued accretive operators in certain Banach spaces, A linearly convergent majorized ADMM with indefinite proximal terms for convex composite programming and its applications, The 𝒰-Lagrangian of a convex function, Stadium Norm and Douglas-Rachford Splitting: A New Approach to Road Design Optimization, A convex analysis approach to optimal controls with switching structure for partial differential equations, Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems, Construction of fixed points of nonlinear mappings in Hilbert space, Fréchet differentiability of convex functions, Strongly Convex Functions, Moreau Envelopes, and the Generic Nature of Convex Functions with Strong Minimizers, Équations et inéquations non linéaires dans les espaces vectoriels en dualité, Merit functions and error bounds for constrained mixed set-valued variational inequalities via generalizedf-projection operators, Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming, An Alternating Semiproximal Method for Nonconvex Regularized Structured Total Least Squares Problems, On the virtual convexity of the domain and range of a nonlinear maximal monotone operator, Fonctions 'spline' definies sur un ensemble convexe, Measurable dependence of convex sets and functions on parameters, Majorantes sur-harmoniques minimales d'une fonction continue, A sequential updating scheme of the Lagrange multiplier for separable convex programming, Propriétés régularisantes de certains semi-groupes non linéaires, Conjugate convex functions, duality, and optimal control problems. I: Systems governed by ordinary differential equations, Opérateurs monotones non linéaires dans les espaces de Banach non réflexifs. (Nonlinear monotone operators on nonreflexive Banach spaces), Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization, Dual variational inequalities, Fenchel duality, Fitzpatrick functions and the extension of firmly nonexpansive mappings, A proximal trust-region algorithm for column generation stabilization, Unnamed Item, Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization, A $\mathcal{VU}$-algorithm for convex minimization, Unnamed Item, Nonlinear eigenvalue problems characterized by variational inequalities with applications to the postbuckling analysis of unilaterally-supported plates

Cites Work