Partial inverse of a monotone operator
From MaRDI portal
accretive operatorconvex feasibility problemsHilbert spacemaximal monotone operatormonotone complementarity problemsnetwork equilibrium problemspartial inverseproximal point algorithmvariational problems
Linear accretive operators, dissipative operators, etc. (47B44) Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Programming involving graphs or networks (90C35) Methods of successive quadratic programming type (90C55) General equilibrium theory (91B50)
Cites work
- A general correspondence between dual minimax problems and convex programs
- An extension of Fenchel's duality theorem to saddle functions and dual minimax problems
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Conjugacy Correspondences: A Unified View
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3788387 (Why is no real title available?)
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- scientific article; zbMATH DE number 3633204 (Why is no real title available?)
- scientific article; zbMATH DE number 3359250 (Why is no real title available?)
- Monotone (nonlinear) operators in Hilbert space
- Monotone Operators and the Proximal Point Algorithm
- On the Maximality of Sums of Nonlinear Monotone Operators
- Proximité et dualité dans un espace hilbertien
- The multiplier method of Hestenes and Powell applied to convex programming
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Solving Systems of Linear Inequalities
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
Cited in
(95)- A primal-dual projection method for solving systems of linear inequalities
- Decomposition method of descent for minimizing the sum of convex nonsmooth functions
- On some optimization techniques in image reconstruction from projections
- A parallel projection method for solving generalized linear least-squares problems
- Extended scenario analysis
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Application of the alternating direction method of multipliers to separable convex programming problems
- Primal-dual proximal point algorithm for linearly constrained convex programming problems
- Progressive regularization of variational inequalities and decomposition algorithms
- Prox-regularization and solution of ill-posed elliptic variational inequalities
- A variable-penalty alternating directions method for convex optimization
- Parallel alternating direction multiplier decomposition of convex programs
- Duality results and proximal solutions of the Huber M-estimator problem
- Conditioning and regularization of nonsymmetric operators
- Finite convergence of the partial inverse algorithm
- Monotone operator theory in convex optimization
- On the complexity of the projective splitting and Spingarn's methods for the sum of two maximal monotone operators
- An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization
- Solving monotone stochastic variational inequalities and complementarity problems by progressive hedging
- The Douglas-Rachford algorithm in the affine-convex case
- A projection method for least-squares solutions to overdetermined systems of linear inequalities
- Scenario analysis via bundle decomposition
- A partial complement method for approximating solutions of a primal dual fixed-point problem
- Weak convergence of an extended splitting method for monotone inclusions
- Preconditioned Douglas-Rachford type primal-dual method for solving composite monotone inclusion problems with applications
- The elicited progressive decoupling algorithm: a note on the rate of convergence and a preliminary numerical experiment on the choice of parameters
- Four-operator splitting via a forward-backward-half-forward algorithm with line search
- Solving Lagrangian variational inequalities with applications to stochastic programming
- Risk minimization, regret minimization and progressive hedging algorithms
- Learning with tensors: a framework based on convex optimization and spectral regularization
- Projective splitting methods for sums of maximal monotone operators with applications
- Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity
- On the equivalence of the primal-dual hybrid gradient method and Douglas-Rachford splitting
- A note on the forward-Douglas-Rachford splitting for monotone inclusion and convex optimization
- A family of projective splitting methods for the sum of two maximal monotone operators
- A splitting method for stochastic programs
- Splitting-type method for systems of variational inequalities
- Forward-partial inverse-half-forward splitting algorithm for solving monotone inclusions
- A primal-dual partial inverse algorithm for constrained monotone inclusions: applications to stochastic programming and mean field games
- A proximal multiplier method for separable convex minimization
- Preconditioning of a generalized forward-backward splitting and application to optimization on graphs
- On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces
- Proximal splitting methods in signal processing
- Decomposition methods based on augmented Lagrangians: a survey
- A proximal alternating linearization method for nonconvex optimization problems
- A survey on operator splitting and decomposition of convex programs
- Convergence rate of a proximal multiplier algorithm for separable convex minimization
- Conic optimization via operator splitting and homogeneous self-dual embedding
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
- Comparing averaged relaxed cutters and projection methods: theory and examples
- A unified splitting algorithm for composite monotone inclusions
- A Variable Krasnoselski–Mann Algorithm for a New Class of Fixed Point Problems
- Decomposition methods for sparse matrix nearness problems
- Applications of the method of partial inverses to convex programming: Decomposition
- A practical relative error criterion for augmented Lagrangians
- Fast alternating linearization methods for minimizing the sum of two convex functions
- A primal-dual algorithm for the fermat-weber problem involving mixed gauges
- Existence and proximal point algorithms for nonlinear monotone complementarity problems*
- Coupling proximal methods and variational convergence
- Partial regularization of the sum of two maximal monotone operators
- The cluster set of a nonexpansive mapping
- A primal-dual method of partial inverses for composite inclusions
- Weighted-average alternating minimization method for magnetic resonance image reconstruction based on compressive sensing
- A SPLITTING METHOD FOR COMPOSITE MAPPINGS
- Partial inverse operator and recession notion
- Forward-partial inverse-forward splitting for solving monotone inclusions
- Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
- Another proof and a generalization of a theorem of H. H. Bauschke on monotone operators
- The Douglas-Rachford algorithm converges only weakly
- On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm
- Adaptive Douglas-Rachford splitting algorithm for the sum of two operators
- Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions
- An inexact method of partial inverses and a parallel bundle method
- Combining The Proximal Algorithm And Tikhonov Regularization
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Fifty years of maximal monotonicity
- Generalizations of the proximal method of multipliers in convex optimization
- Generic linear convergence through metric subregularity in a variable-metric extension of the proximal point algorithm
- An accelerated forward-backward-half forward splitting algorithm for monotone inclusion with applications to image restoration
- Implications of the constant rank constraint qualification
- The geometry of monotone operator splitting methods
- Forward-reflected-backward and shadow-Douglas-Rachford with partial inverse for solving monotone inclusions
- Optimization problems governed by systems of PDEs with uncertainties
- Bayesian Nash equilibrium in price competition under multinomial logit demand
- Parametrized families of resolvent compositions
- Understanding the Douglas-Rachford splitting method through the lenses of Moreau-type envelopes
- A progressive decoupling algorithm for minimizing the difference of convex and weakly convex functions
- Deconvolution under Poisson noise using exact data fidelity and synthesis or analysis sparsity priors
- Over relaxed hybrid proximal extragradient algorithm and its application to several operator splitting methods
- Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- An LS-free splitting method for composite mappings
- Duality for constrained multifacility location problems with mixed norms and applications
- Visco-penalization of the sum of two monotone operators
This page was built for publication: Partial inverse of a monotone operator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q585088)
