Partial inverse of a monotone operator

DOI10.1007/BF01448388zbMath0524.90072MaRDI QIDQ585088

Publication date: 1983

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

accretive operator; Hilbert space; maximal monotone operator; variational problems; proximal point algorithm; partial inverse; convex feasibility problems; monotone complementarity problems; network equilibrium problems

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C25: Convex programming

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

91B50: General equilibrium theory

90C55: Methods of successive quadratic programming type

47B44: Linear accretive operators, dissipative operators, etc.

Related Items

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 SPLITTING METHOD FOR COMPOSITE MAPPINGS, Partial inverse operator and recession notion, 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, 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, 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, A projection method for least-squares solutions to overdetermined systems of linear inequalities, Scenario analysis via bundle decomposition, 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, A Variable Krasnoselski–Mann Algorithm for a New Class of Fixed Point Problems, Applications of the method of partial inverses to convex programming: Decomposition, A primal-dual algorithm for the fermat-weber problem involving mixed gauges

Cites Work