On the public citation graph

Proximal Decomposition on the Graph of a Maximal Monotone Operator

https://doi.org/10.1137/0805023
0 signed · 61 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01448388openalex-snapshot
Partial inverse of a monotone operator
inferredcites →https://doi.org/10.1007/bf01581204openalex-snapshot
On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators
inferredcites →https://doi.org/10.1007/bf01586091openalex-snapshot
Applications of the method of partial inverses to convex programming: Decomposition
inferredcites →https://doi.org/10.1007/bfb0083585openalex-snapshot
Applications and numerical convergence of the partial inverse method
inferredcites →https://doi.org/10.1017/cbo9780511526152openalex-snapshot
Topics in Metric Fixed Point Theory
inferredcites →https://doi.org/10.1090/s0002-9904-1967-11761-0openalex-snapshot
Weak convergence of the sequence of successive approximations for nonexpansive mappings
inferredcites →https://doi.org/10.1112/plms/s3-55.3.605openalex-snapshot
On Fixed Points of Non-Expansive Piecewise Isometric Mappings
inferredcites →https://doi.org/10.1137/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
inferredcites →https://doi.org/10.1137/0716071openalex-snapshot
Splitting Algorithms for the Sum of Two Nonlinear Operators

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-0-387-30165-5_10openalex-snapshot
Multicommodity Flow Problems and Decomposition in Telecommunications Networks
inferred← citeshttps://doi.org/10.1007/978-1-4419-9640-4_11openalex-snapshot
Decomposition Methods Based on Augmented Lagrangians: A Survey
inferred← citeshttps://doi.org/10.1007/978-1-4613-0279-7_17openalex-snapshot
D.C. Optimization Approaches via Markov Models for Restoration of Signal (1-D) and (2-D)
inferred← citeshttps://doi.org/10.1007/978-1-4614-5128-0_13openalex-snapshot
DC Programming Approaches for Distance Geometry Problems
inferred← citeshttps://doi.org/10.1007/978-1-4757-3218-4_18openalex-snapshot
D.C. Programming Approach for Large-Scale Molecular Optimization via the General Distance Geometry Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-31339-5_17openalex-snapshot
On Algorithms for Difference of Monotone Operators
inferred← citeshttps://doi.org/10.1007/978-3-030-44625-3_21openalex-snapshot
On Algorithms for Difference of Monotone Operators
inferred← citeshttps://doi.org/10.1007/978-3-642-54455-2_1openalex-snapshot
Recent Advances in DC Programming and DCA
inferred← citeshttps://doi.org/10.1007/978-3-642-57014-8_19openalex-snapshot
Adaptive Scaling and Convergence Rates of a Separable Augmented Lagrangian Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-59073-3_7openalex-snapshot
A New Decomposition Method in Nonconvex Programming Via a Separable Augmented Lagrangian
inferred← citeshttps://doi.org/10.1007/bf02110041openalex-snapshot
Proximal decomposition for multicommodity flow problems with convex costs
inferred← citeshttps://doi.org/10.1007/s00186-017-0573-5openalex-snapshot
Decomposition methods for a spatial model for long-term energy pricing problem
inferred← citeshttps://doi.org/10.1007/s10107-003-0371-0openalex-snapshot
Epsilon-proximal decomposition method
inferred← citeshttps://doi.org/10.1007/s10107-018-1253-9openalex-snapshot
A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems
inferred← citeshttps://doi.org/10.1007/s10107-018-1303-3openalex-snapshot
Monotone operator theory in convex optimization
inferred← citeshttps://doi.org/10.1007/s10479-004-5022-1openalex-snapshot
The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10898-015-0373-5openalex-snapshot
On Slater’s condition and finite convergence of the Douglas–Rachford algorithm for solving convex feasibility problems in Euclidean spaces
inferred← citeshttps://doi.org/10.1007/s10957-005-6547-4openalex-snapshot
Separable Augmented Lagrangian Algorithm with Multidimensional Scaling for Monotropic Programming
inferred← citeshttps://doi.org/10.1007/s10957-009-9566-8openalex-snapshot
Interior-Point Lagrangian Decomposition Method for Separable Convex Optimization
inferred← citeshttps://doi.org/10.1007/s10957-018-1345-yopenalex-snapshot
Convergence Analysis of Difference-of-Convex Algorithm with Subanalytic Data
inferred← citeshttps://doi.org/10.1007/s11228-018-0496-1openalex-snapshot
Progressive Decoupling of Linkages in Optimization and Variational Inequalities with Elicitable Convexity or Monotonicity
inferred← citeshttps://doi.org/10.1007/s11590-014-0734-xopenalex-snapshot
A primal-dual method of partial inverses for composite inclusions
inferred← citeshttps://doi.org/10.1016/0167-6377(96)00022-3openalex-snapshot
Numerical solution for optimization over the efficient set by d.c. optimization algorithms
inferred← citeshttps://doi.org/10.1016/j.amc.2003.11.040openalex-snapshot
Two-level primal–dual proximal decomposition technique to solve large scale optimization problems
inferred← citeshttps://doi.org/10.1016/j.epsr.2020.106681openalex-snapshot
Toward a scalable robust security-constrained optimal power flow using a proximal projection bundle method
inferred← citeshttps://doi.org/10.1016/j.neucom.2021.09.039openalex-snapshot
DCA based approaches for bi-level variable selection and application for estimate multiple sparse covariance matrices
inferred← citeshttps://doi.org/10.1016/s0167-6377(96)00036-3openalex-snapshot
Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres
inferred← citeshttps://doi.org/10.1016/s0377-0427(02)00730-6openalex-snapshot
Some recent advances in projection-type methods for variational inequalities
inferred← citeshttps://doi.org/10.1023/a:1013867331662openalex-snapshot
D.C. programming approach for multicommodity network optimization problems with step increasing cost functions
inferred← citeshttps://doi.org/10.1023/a:1022646327085openalex-snapshot
Convergence Analysis and Applications of the Glowinski–Le Tallec Splitting Method for Finding a Zero of the Sum of Two Maximal Monotone Operators
inferred← citeshttps://doi.org/10.1051/ro/2015065openalex-snapshot
A survey on operator splitting and decomposition of convex programs
inferred← citeshttps://doi.org/10.1080/02331934.2015.1062009openalex-snapshot
A proximal multiplier method for separable convex minimization
inferred← citeshttps://doi.org/10.1080/02331934.2018.1476860openalex-snapshot
On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm
inferred← citeshttps://doi.org/10.1080/10556780500094887openalex-snapshot
An inexact method of partial inverses and a parallel bundle method
inferred← citeshttps://doi.org/10.1080/10556780802263990openalex-snapshot
Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming
inferred← citeshttps://doi.org/10.1080/10556788.2013.854358openalex-snapshot
A proximal alternating linearization method for nonconvex optimization problems
inferred← citeshttps://doi.org/10.1109/iccnc.2012.6167536openalex-snapshot
Solving Many to many multicast QoS routing problem using DCA and proximal decomposition technique
inferred← citeshttps://doi.org/10.1109/tac.2008.2007159openalex-snapshot
Application of a Smoothing Technique to Decomposition in Convex Optimization
inferred← citeshttps://doi.org/10.1137/s1052623494274313openalex-snapshot
A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
inferred← citeshttps://doi.org/10.1137/s1052623495288064openalex-snapshot
Proximal Decomposition Via Alternating Linearization
inferred← citeshttps://doi.org/10.1137/s1052623498342794openalex-snapshot
Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
inferred← citeshttps://doi.org/10.1155/2012/281396openalex-snapshot
An Asymmetric Proximal Decomposition Method for Convex Programming with Linearly Coupling Constraints
inferred← citeshttps://doi.org/10.1155/2012/471854openalex-snapshot
Modified Lagrangian Methods for Separable Optimization Problems
inferred← citeshttps://doi.org/10.1155/2012/925915openalex-snapshot
Numerical Methods for Solving Variational Inequalities and Complementarity Problems
inferred← citeshttps://doi.org/10.1287/ijoc.10.2.218openalex-snapshot
Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control
inferred← citeshttps://doi.org/10.1287/mnsc.46.1.126.15132openalex-snapshot
A Survey of Algorithms for Convex Multicommodity Flow Problems
inferred← citeshttps://doi.org/10.15381/pes.v14i2.9590openalex-snapshot
UN MÉTODO MULTIPLICADOR PROXIMAL PARA OPTIMIZACIÓN CONVEXA SEPARABLE
inferred← citeshttps://doi.org/10.25439/rmt.27579633openalex-snapshot
Decomposition and duality based approaches to stochastic integer programming
inferred← citeshttps://doi.org/10.48550/arxiv.1310.1152openalex-snapshot
A Primal-Dual Method of Partial Inverses for Composite Inclusions
inferred← citeshttps://doi.org/10.48550/arxiv.1711.09959openalex-snapshot
On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.2003.03437openalex-snapshot
Proximal bundle algorithms for nonsmooth convex optimization via fast gradient smooth methods
inferred← citeshttps://doi.org/10.70675/c36217cdz0d6az4daaz9916zc10de7afdbe7openalex-snapshot
On proximal decomposition methods applied to power generation planning in an uncertain environment
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.