On Algorithms for Difference of Monotone Operators

DOI10.1007/978-3-030-44625-3_21OpenAlexW4251570373MaRDI QIDQ5896140

Mohsen Alimohammady, M. Ramazannejad, Carlo Cattani

Publication date: 29 July 2020

Published in: Computational Mathematics and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-44625-3_21

Mathematics Subject Classification ID

Existence theories in calculus of variations and optimal control (49Jxx) Numerical analysis in abstract spaces (65Jxx)

Related Items (2)

Unnamed Item ⋮ Invariance solutions and blow-up property for edge degenerate pseudo-hyperbolic equations in edge Sobolev spaces

Uses Software

• UNLocBoX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• A proximal point algorithm for DC functions on Hadamard manifolds
• On the difference of two maximal monotone operators: Regularization and algorithmic approaches
• Minimax second-order designs over cuboidal regions for the difference between two estimated responses
• Duality in nonconvex optimization
• A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
• Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres
• Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Ishikawa iteration process with errors for nonexpansive mappings in uniformly convex Banach spaces
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Notes on the difference of two monotone operators
• Set-valued mappings and enlargement of monotone operators.
• On critical points of the difference of two maximal monotone operators
• Nonlinear maximal monotone operators in Banach space
• Local boundedness of nonlinear, monotone operators
• The fixed point theory of multi-valued mappings in topological vector spaces
• On the maximal monotonicity of subdifferential mappings
• Strong pseudo-convex programming
• Discrete tomography by convex--concave regularization and D.C. programming
• A continuous approch for globally solving linearly constrained quadratic
• Proximal Splitting Methods in Signal Processing
• Optimization with Sparsity-Inducing Penalties
• Convergence analysis of a proximal point algorithm for minimizing differences of functions
• Dithering by Differences of Convex Functions
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Monotone networks
• Nonlinear Ill-posed Problems of Monotone Type
• Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
• Clarke Subgradients of Stratifiable Functions
• Generalized Gradients and Applications
• Monotone Operators and the Proximal Point Algorithm
• Variational Analysis
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
• Proximal Decomposition on the Graph of a Maximal Monotone Operator
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Multi-Valued Monotone Nonlinear Mappings and Duality Mappings in Banach Spaces
• On the Subdifferentiability of Convex Functions
• Set-valued analysis

This page was built for publication: On Algorithms for Difference of Monotone Operators