Partial inverse of a monotone operator
From MaRDI portal
Hilbert spaceaccretive operatormaximal monotone operatorproximal point algorithmvariational problemspartial inverseconvex feasibility problemsmonotone complementarity problemsnetwork equilibrium problems
Convex programming (90C25) Methods of successive quadratic programming type (90C55) Programming involving graphs or networks (90C35) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Linear accretive operators, dissipative operators, etc. (47B44) General equilibrium theory (91B50)
Cites work
- 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?)
- 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
- 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 Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Solving Systems of Linear Inequalities
- The multiplier method of Hestenes and Powell applied to convex programming
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
Cited in
(90)- A splitting method for stochastic programs
- Solving Lagrangian variational inequalities with applications to stochastic programming
- Existence and proximal point algorithms for nonlinear monotone complementarity problems*
- Primal-dual proximal point algorithm for linearly constrained convex programming problems
- Decomposition methods for sparse matrix nearness problems
- Applications of the method of partial inverses to convex programming: Decomposition
- A primal-dual partial inverse algorithm for constrained monotone inclusions: applications to stochastic programming and mean field games
- A parallel projection method for solving generalized linear least-squares problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces
- An accelerated forward-backward-half forward splitting algorithm for monotone inclusion with applications to image restoration
- Prox-regularization and solution of ill-posed elliptic variational inequalities
- Application of the alternating direction method of multipliers to separable convex programming problems
- Deconvolution under Poisson noise using exact data fidelity and synthesis or analysis sparsity priors
- Proximal splitting methods in signal processing
- Scenario analysis via bundle decomposition
- A proximal multiplier method for separable convex minimization
- Coupling proximal methods and variational convergence
- Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions
- Progressive regularization of variational inequalities and decomposition algorithms
- Forward-partial inverse-forward splitting for solving monotone inclusions
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- An inexact method of partial inverses and a parallel bundle method
- Weak convergence of an extended splitting method for monotone inclusions
- The geometry of monotone operator splitting methods
- A primal-dual projection method for solving systems of linear inequalities
- Over relaxed hybrid proximal extragradient algorithm and its application to several operator splitting methods
- Partial inverse operator and recession notion
- Adaptive Douglas-Rachford splitting algorithm for the sum of two operators
- Visco-penalization of the sum of two monotone operators
- On the equivalence of the primal-dual hybrid gradient method and Douglas-Rachford splitting
- SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD
- Generalizations of the proximal method of multipliers in convex optimization
- Implications of the constant rank constraint qualification
- Fifty years of maximal monotonicity
- Another proof and a generalization of a theorem of H. H. Bauschke on monotone operators
- Preconditioning of a generalized forward-backward splitting and application to optimization on graphs
- A variable-penalty alternating directions method for convex optimization
- A SPLITTING METHOD FOR COMPOSITE MAPPINGS
- Conditioning and regularization of nonsymmetric operators
- Comparing averaged relaxed cutters and projection methods: theory and examples
- On the complexity of the projective splitting and Spingarn's methods for the sum of two maximal monotone operators
- On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm
- Generic linear convergence through metric subregularity in a variable-metric extension of the proximal point algorithm
- Splitting-type method for systems of variational inequalities
- A survey on operator splitting and decomposition of convex programs
- A family of projective splitting methods for the sum of two maximal monotone operators
- The Douglas-Rachford algorithm in the affine-convex case
- 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 proximal alternating linearization method for nonconvex optimization problems
- Extended scenario analysis
- Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Duality for constrained multifacility location problems with mixed norms and applications
- Duality results and proximal solutions of the Huber M-estimator problem
- A note on the forward-Douglas-Rachford splitting for monotone inclusion and convex optimization
- A unified splitting algorithm for composite monotone inclusions
- The elicited progressive decoupling algorithm: a note on the rate of convergence and a preliminary numerical experiment on the choice of parameters
- The cluster set of a nonexpansive mapping
- Fast alternating linearization methods for minimizing the sum of two convex functions
- Learning with tensors: a framework based on convex optimization and spectral regularization
- A Variable Krasnoselski–Mann Algorithm for a New Class of Fixed Point Problems
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
- Progressive decoupling of linkages in optimization and variational inequalities with elicitable convexity or monotonicity
- An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization
- Projective splitting methods for sums of maximal monotone operators with applications
- Forward-partial inverse-half-forward splitting algorithm for solving monotone inclusions
- Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates
- The Douglas-Rachford algorithm converges only weakly
- Risk minimization, regret minimization and progressive hedging algorithms
- Forward-reflected-backward and shadow-Douglas-Rachford with partial inverse for solving monotone inclusions
- Combining The Proximal Algorithm And Tikhonov Regularization
- Partial regularization of the sum of two maximal monotone operators
- Four-operator splitting via a forward-backward-half-forward algorithm with line search
- A practical relative error criterion for augmented Lagrangians
- Solving monotone stochastic variational inequalities and complementarity problems by progressive hedging
- A projection method for least-squares solutions to overdetermined systems of linear inequalities
- Convergence rate of a proximal multiplier algorithm for separable convex minimization
- Decomposition method of descent for minimizing the sum of convex nonsmooth functions
- Decomposition methods based on augmented Lagrangians: a survey
- Parallel alternating direction multiplier decomposition of convex programs
- Monotone operator theory in convex optimization
- A partial complement method for approximating solutions of a primal dual fixed-point problem
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Finite convergence of the partial inverse algorithm
- An LS-free splitting method for composite mappings
- Preconditioned Douglas-Rachford type primal-dual method for solving composite monotone inclusion problems with applications
- A primal-dual algorithm for the fermat-weber problem involving mixed gauges
- On some optimization techniques in image reconstruction from projections
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)
