On the public citation graph
Applications of the method of partial inverses to convex programming: Decomposition
0 signed · 169 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/nav.3800030109openalex-snapshot
An algorithm for quadratic programming
inferredcites →https://doi.org/10.1007/bf00933211openalex-snapshot
Decomposition in large system optimization using the method of multipliers
inferredcites →https://doi.org/10.1007/bf00933339openalex-snapshot
The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
inferredcites →https://doi.org/10.1007/bf00934554openalex-snapshot
Auxiliary problem principle and decomposition of optimization problems
inferredcites →https://doi.org/10.1007/bf00934777openalex-snapshot
The multiplier method of Hestenes and Powell applied to convex programming
inferredcites →https://doi.org/10.1007/bf00937167openalex-snapshot
Convexification procedures and decomposition methods for nonconvex optimization problems
inferredcites →https://doi.org/10.1007/bf01448388openalex-snapshot
Partial inverse of a monotone operator
inferredcites →https://doi.org/10.1007/bf01580677openalex-snapshot
Sensitivity analysis for nonlinear programming using penalty methods
inferredcites →https://doi.org/10.1007/bf01585500openalex-snapshot
Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
inferredcites →https://doi.org/10.1016/0024-3795(85)90086-2openalex-snapshot
A primal-dual projection method for solving systems of linear inequalities
inferredcites →https://doi.org/10.1016/0898-1221(76)90003-1openalex-snapshot
A dual algorithm for the solution of nonlinear variational problems via finite element approximation
inferredcites →https://doi.org/10.1016/b978-0-12-468660-1.50006-2openalex-snapshot
MONOTONE OPERATORS AND AUGMENTED LAGRANGIAN METHODS IN NONLINEAR PROGRAMMING
inferredcites →https://doi.org/10.1016/c2009-0-19672-1openalex-snapshot
Convex Analysis and Variational Problems
inferredcites →https://doi.org/10.1016/s0168-2024(08)70028-6openalex-snapshot
Chapter III On Decomposition-Coordination Methods Using an Augmented Lagrangian
inferredcites →https://doi.org/10.1016/s0168-2024(08)x7003-1openalex-snapshot
Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems
inferredcites →https://doi.org/10.1057/jors.1981.65openalex-snapshot
Control and Coordination in Hierarchical Systems
inferredcites →https://doi.org/10.1109/tac.1978.1101718openalex-snapshot
Optimization by decomposition and coordination: A unified approach
inferredcites →https://doi.org/10.1109/tsmc.1971.4308301openalex-snapshot
Optimization Theory of Large Systems
inferredcites →https://doi.org/10.1137/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
inferredcites →https://doi.org/10.1137/0318021openalex-snapshot
Fixed and Variable Constraints in Sensitivity Analysis
inferredcites →https://doi.org/10.1137/0322019openalex-snapshot
Asymptotic Convergence Analysis of the Proximal Point Algorithm
inferredcites →https://doi.org/10.1215/s0012-7094-62-02933-2openalex-snapshot
Monotone (nonlinear) operators in Hilbert space
inferredcites →https://doi.org/10.1287/moor.1.2.97openalex-snapshot
Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
inferredcites →https://doi.org/10.1287/opre.11.3.399openalex-snapshot
Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
inferredcites →https://doi.org/10.1287/opre.18.3.375openalex-snapshot
Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems
inferredcites →https://doi.org/10.1287/opre.8.1.101openalex-snapshot
Decomposition Principle for Linear Programs
inferredcites →https://doi.org/10.1515/9781400884179openalex-snapshot
Linear Programming and Extensions
inferredcites →https://doi.org/10.2140/pjm.1970.33.209openalex-snapshot
On the maximal monotonicity of subdifferential mappings
inferredcites →https://doi.org/10.2307/2002823openalex-snapshot
Studies in Linear and Non-Linear Programming.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781118600283.ch9openalex-snapshot
Network Design Problems: Fundamental Methods
inferred← citeshttps://doi.org/10.1002/9781119005384.ch9openalex-snapshot
Network Design Problems: Fundamental Methods
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_248openalex-snapshot
Lagrangian Multipliers Methods for Convex Programming
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_321openalex-snapshot
Lagrangian Multipliers Methods for Convex Programming
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-0239-1_2openalex-snapshot
The Log—Quadratic Proximal Methodology in Convex Optimization Algorithms and Variational Inequalities
inferred← citeshttps://doi.org/10.1007/978-1-4613-0287-2_25openalex-snapshot
Proximal Methods for Variational Inequalities with Set-Valued Monotone Operators
inferred← citeshttps://doi.org/10.1007/978-1-4615-3600-0_9openalex-snapshot
Applications of Generalized Inverses
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_321-1openalex-snapshot
Lagrangian Multiplier Methods for Convex Programming
inferred← citeshttps://doi.org/10.1007/978-3-030-93736-2_14openalex-snapshot
Splitting Algorithms for Federated Learning
inferred← citeshttps://doi.org/10.1007/978-3-031-11748-0_5openalex-snapshot
A Unifying Framework for Federated Learning
inferred← citeshttps://doi.org/10.1007/978-3-0348-9297-1_11openalex-snapshot
About the finite convergence of the proximal point algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-67068-3_4openalex-snapshot
Parameter Selection and Preconditioning for a Graph Form Solver
inferred← citeshttps://doi.org/10.1007/978-3-319-97478-1_3openalex-snapshot
Decomposition Methods for Large-Scale Semidefinite Programs with Chordal Aggregate Sparsity and Partial Orthogonality
inferred← citeshttps://doi.org/10.1007/978-3-642-51682-5_4openalex-snapshot
About the Convergence of the Proximal Method
inferred← citeshttps://doi.org/10.1007/978-3-642-51682-5_7openalex-snapshot
Mixing proximal regularization, penalization and parallel decomposition in convex programming
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-57014-8_20openalex-snapshot
Numerical Considerations on Decomposition and Augmented Lagrangians
inferred← citeshttps://doi.org/10.1007/978-3-642-59073-3_10openalex-snapshot
Multi–Step Proximal Method for Variational Inequalities with Monotone Operators
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/bf00247655openalex-snapshot
Application of the alternating direction method of multipliers to separable convex programming problems
inferred← citeshttps://doi.org/10.1007/bf01194548openalex-snapshot
A proximal point algorithm for control approximation problems
inferred← citeshttps://doi.org/10.1007/bf01300861openalex-snapshot
Algorithms for the solution of stochastic dynamic minimax problems
inferred← citeshttps://doi.org/10.1007/bf01416609openalex-snapshot
Coupling proximal methods and variational convergence
inferred← citeshttps://doi.org/10.1007/bf01581204openalex-snapshot
On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators
inferred← citeshttps://doi.org/10.1007/bf01582255openalex-snapshot
Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
inferred← citeshttps://doi.org/10.1007/bf01582566openalex-snapshot
A proximal-based decomposition method for convex minimization problems
inferred← citeshttps://doi.org/10.1007/bf02097796openalex-snapshot
Duality for constrained multifacility location problems with mixed norms and applications
inferred← citeshttps://doi.org/10.1007/bf02110041openalex-snapshot
Proximal decomposition for multicommodity flow problems with convex costs
inferred← citeshttps://doi.org/10.1007/bf02191984openalex-snapshot
Approximations in proximal bundle methods and decomposition of convex programs
inferred← citeshttps://doi.org/10.1007/bf02196592openalex-snapshot
Parallel alternating direction multiplier decomposition of convex programs
inferred← citeshttps://doi.org/10.1007/bf02592098openalex-snapshot
A quasi-second-order proximal bundle algorithm
inferred← citeshttps://doi.org/10.1007/bf02614323openalex-snapshot
Decomposition methods in stochastic programming
inferred← citeshttps://doi.org/10.1007/bf02680549openalex-snapshot
A variable-penalty alternating directions method for convex optimization
inferred← citeshttps://doi.org/10.1007/bf02925056openalex-snapshot
The cluster set of a nonexpansive mapping
inferred← citeshttps://doi.org/10.1007/bfb0083585openalex-snapshot
Applications and numerical convergence of the partial inverse method
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/s00186-024-00878-9openalex-snapshot
Forward-reflected-backward and shadow-Douglas–Rachford with partial inverse for solving monotone inclusions
inferred← citeshttps://doi.org/10.1007/s10107-003-0371-0openalex-snapshot
Epsilon-proximal decomposition method
inferred← citeshttps://doi.org/10.1007/s10107-012-0599-7openalex-snapshot
A class of Dantzig–Wolfe type decomposition methods for variational inequality problems
inferred← citeshttps://doi.org/10.1007/s10107-018-1303-3openalex-snapshot
Monotone operator theory in convex optimization
inferred← citeshttps://doi.org/10.1007/s10107-018-1321-1openalex-snapshot
On the equivalence of the primal-dual hybrid gradient method and Douglas–Rachford splitting
inferred← citeshttps://doi.org/10.1007/s10107-019-01403-1openalex-snapshot
Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting
inferred← citeshttps://doi.org/10.1007/s10107-022-01809-4openalex-snapshot
Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry
inferred← citeshttps://doi.org/10.1007/s101070100241openalex-snapshot
Entropic proximal decomposition methods for convex programs and variational inequalities
inferred← citeshttps://doi.org/10.1007/s10589-012-9515-6openalex-snapshot
Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
inferred← citeshttps://doi.org/10.1007/s10589-018-0039-6openalex-snapshot
Convergence of the augmented decomposition algorithm
inferred← citeshttps://doi.org/10.1007/s10589-020-00211-0openalex-snapshot
The distance between convex sets with Minkowski sum structure: application to collision detection
inferred← citeshttps://doi.org/10.1007/s10589-023-00519-7openalex-snapshot
Generalizations of the proximal method of multipliers in convex optimization
inferred← citeshttps://doi.org/10.1007/s10915-026-03497-0openalex-snapshot
A Variable Metric Douglas–Rachford Splitting Method for Nonconvex Composite Optimization
inferred← citeshttps://doi.org/10.1007/s10957-015-0703-2openalex-snapshot
Forward–Partial Inverse–Forward Splitting for Solving Monotone Inclusions
inferred← citeshttps://doi.org/10.1007/s10957-016-0892-3openalex-snapshot
Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding
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/s11228-022-00649-wopenalex-snapshot
Forward-partial inverse-half-forward splitting algorithm for solving monotone inclusions
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/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.amc.2003.12.137openalex-snapshot
A primal-dual proximal point algorithm for constrained convex programs
inferred← citeshttps://doi.org/10.1016/j.jmaa.2016.11.018openalex-snapshot
Over relaxed hybrid proximal extragradient algorithm and its application to several operator splitting methods
inferred← citeshttps://doi.org/10.1016/j.jprocont.2010.12.010openalex-snapshot
Parallel and distributed optimization methods for estimation and control in networks
inferred← citeshttps://doi.org/10.1016/j.specom.2015.09.013openalex-snapshot
Fast algorithms for high-order sparse linear prediction with applications to speech processing
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)52088-1openalex-snapshot
Approximations in Decomposition of Large-Scale Convex Programs via a Nondifferentiable Optimization Method
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)55125-3openalex-snapshot
A Super-linear Convergent Primal-dual Method for Nonconvex Optimization
inferred← citeshttps://doi.org/10.1023/a:1015546212618openalex-snapshot
Planning Models for Wide-Area Communication Network Design with Response-Time-Dependent Offered Traffic
inferred← citeshttps://doi.org/10.1023/a:1018916816192openalex-snapshot
Parallel proximal decomposition algorithmsfor robust estimation
inferred← citeshttps://doi.org/10.1023/a:1018965626303openalex-snapshot
Some advances in decomposition methodsfor stochastic linear programming
inferred← citeshttps://doi.org/10.1023/a:1022243127667openalex-snapshot
Prox-regularization and solution of ill-posed elliptic variational inequalities
inferred← citeshttps://doi.org/10.1023/a:1022634902457openalex-snapshot
Progressive Regularization of Variational Inequalities and Decomposition Algorithms
inferred← citeshttps://doi.org/10.1023/a:1022692114480openalex-snapshot
Conditioning and Regularization of Nonsymmetric 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/02331930412331327157openalex-snapshot
Solving monotone inclusions via compositions of nonexpansive averaged operators
inferred← citeshttps://doi.org/10.1080/02331934.2013.855210openalex-snapshot
Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions
inferred← citeshttps://doi.org/10.1080/02331934.2015.1044898openalex-snapshot
Fast inexact decomposition algorithms for large-scale separable convex optimization
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.2016.1261138openalex-snapshot
Convergence rate of a proximal multiplier algorithm 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/02331934.2020.1858833openalex-snapshot
Another proof and a generalization of a theorem of H. H. Bauschke on monotone operators
inferred← citeshttps://doi.org/10.1080/02331939208843843openalex-snapshot
Convexification and decomposition of separable nonconvex optimization problems
inferred← citeshttps://doi.org/10.1080/02331939508844083openalex-snapshot
Multi-step-prox-regularization method for solving convex variation problems
inferred← citeshttps://doi.org/10.1080/02331939908844426openalex-snapshot
Existence and proximal point algorithms for nonlinear monotone complementarity problems*
inferred← citeshttps://doi.org/10.1080/1055678042000218957openalex-snapshot
A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework
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/10556788.2017.1304548openalex-snapshot
A general system for heuristic minimization of convex functions over non-convex sets
inferred← citeshttps://doi.org/10.1080/10556789408805578openalex-snapshot
Some Saddle-function splitting methods for convex programming
inferred← citeshttps://doi.org/10.1088/0266-5611/24/6/065014openalex-snapshot
A proximal decomposition method for solving convex variational inverse problems
inferred← citeshttps://doi.org/10.1109/cdc.2008.4738764openalex-snapshot
A proximal center-based decomposition method for multi-agent convex optimization
inferred← citeshttps://doi.org/10.1109/cdc.2015.7402724openalex-snapshot
Privacy-preserving dual splitting distributed optimization with application to load flattening in California
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.1109/tbdata.2022.3215467openalex-snapshot
Task Allocation Under Geo-Indistinguishability via Group-Based Noise Addition
inferred← citeshttps://doi.org/10.1109/tsp.2009.2039825openalex-snapshot
Improved Dual Decomposition Based Optimization for DSL Dynamic Spectrum Management
inferred← citeshttps://doi.org/10.1109/tsp.2015.2437846openalex-snapshot
A Parallel Low Complexity Zero-Forcing Beamformer Design for Multiuser MIMO Systems Via a Regularized Dual Decomposition Method
inferred← citeshttps://doi.org/10.1137/0328029openalex-snapshot
A Generalization of the Proximal Point Algorithm
inferred← citeshttps://doi.org/10.1137/0329006openalex-snapshot
Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
inferred← citeshttps://doi.org/10.1137/070688146openalex-snapshot
A Class of Inexact Variable Metric Proximal Point Algorithms
inferred← citeshttps://doi.org/10.1137/0804045openalex-snapshot
Coordination in Coarse-Grained Decomposition
inferred← citeshttps://doi.org/10.1137/0805023openalex-snapshot
Proximal Decomposition on the Graph of a Maximal Monotone Operator
inferred← citeshttps://doi.org/10.1137/130920058openalex-snapshot
Optimal Transport with Proximal Splitting
inferred← citeshttps://doi.org/10.1137/130926924openalex-snapshot
Decomposition in Conic Optimization with Partially Separable Structure
inferred← citeshttps://doi.org/10.1137/13094671xopenalex-snapshot
Primal-Dual Decomposition by Operator Splitting and Applications to Image Deblurring
inferred← citeshttps://doi.org/10.1137/130950239openalex-snapshot
Iterative Reweighted Linear Least Squares for Exact Penalty Subproblems on Product Sets
inferred← citeshttps://doi.org/10.1137/15m1011020openalex-snapshot
Decomposition Methods for Sparse Matrix Nearness Problems
inferred← citeshttps://doi.org/10.1137/17m1151067openalex-snapshot
Two-Stage Quadratic Games under Uncertainty and Their Solution by Progressive Hedging Algorithms
inferred← citeshttps://doi.org/10.1137/s0363012992235547openalex-snapshot
A Variable Metric Proximal Point Algorithm for Monotone Operators
inferred← citeshttps://doi.org/10.1137/s0363012998333116openalex-snapshot
Proximal Point Approach and Approximation of Variational Inequalities
inferred← citeshttps://doi.org/10.1137/s0363012998338806openalex-snapshot
A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
inferred← citeshttps://doi.org/10.1137/s1052623495279797openalex-snapshot
Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
inferred← citeshttps://doi.org/10.1137/s1052623495288064openalex-snapshot
Proximal Decomposition Via Alternating Linearization
inferred← citeshttps://doi.org/10.1145/3404716.3404734openalex-snapshot
A Proximal Multiplier Method for Convex Separable Symmetric Cone Optimization
inferred← citeshttps://doi.org/10.1155/2012/471854openalex-snapshot
Modified Lagrangian Methods for Separable Optimization Problems
inferred← citeshttps://doi.org/10.1155/2014/414031openalex-snapshot
On an Iterative Method for Finding a Zero to the Sum of Two Maximal Monotone Operators
inferred← citeshttps://doi.org/10.1186/s13660-015-0554-2openalex-snapshot
A viscosity splitting algorithm for solving inclusion and equilibrium problems
inferred← citeshttps://doi.org/10.11948/2017027openalex-snapshot
WEAK CONVERGENCE OF A SPLITTING ALGORITHM IN HILBERT SPACES
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.1287/moor.16.1.119openalex-snapshot
Scenarios and Policy Aggregation in Optimization Under Uncertainty
inferred← citeshttps://doi.org/10.1561/2200000016openalex-snapshot
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
inferred← citeshttps://doi.org/10.1561/2400000006openalex-snapshot
Chordal Graphs and Semidefinite Optimization
inferred← citeshttps://doi.org/10.1561/9781601984616openalex-snapshot
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
inferred← citeshttps://doi.org/10.1561/9781680830392openalex-snapshot
Chordal Graphs and Semidefinite Optimization
inferred← citeshttps://doi.org/10.22436/jnsa.009.05.74openalex-snapshot
Viscosity splitting methods for variational inclusion and fixed point problems in Hilbert spaces
inferred← citeshttps://doi.org/10.2478/fcds-2026-0002openalex-snapshot
Machine Learning for Multi Objective Convex Separable Programming (MOCSP) with Aggregation of Linear Approximations and Portfolio Optimization
inferred← citeshttps://doi.org/10.3384/9789179291983openalex-snapshot
Distributed Optimization for Control and Estimation
inferred← citeshttps://doi.org/10.3390/math11214413openalex-snapshot
A Customized ADMM Approach for Large-Scale Nonconvex Semidefinite Programming
inferred← citeshttps://doi.org/10.3390/math7020131openalex-snapshot
Iterative Methods for Computing the Resolvent of Composed Operators in Hilbert Spaces
inferred← citeshttps://doi.org/10.3390/math7100922openalex-snapshot
Convergence of Two Splitting Projection Algorithms in Hilbert Spaces
inferred← citeshttps://doi.org/10.3934/ipi.2021014openalex-snapshot
Preconditioned Douglas-Rachford type primal-dual method for solving composite monotone inclusion problems with applications
inferred← citeshttps://doi.org/10.48550/arxiv.1308.5294openalex-snapshot
Solving Multiple-Block Separable Convex Minimization Problems Using Two-Block Alternating Direction Method of Multipliers
inferred← citeshttps://doi.org/10.48550/arxiv.1506.05485openalex-snapshot
On the Convergence Analysis of Asynchronous Distributed Quadratic Programming via Dual Decomposition
inferred← citeshttps://doi.org/10.48550/arxiv.1601.07277openalex-snapshot
A General System for Heuristic Solution of Convex Problems over Nonconvex Sets
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.48550/arxiv.2108.05974openalex-snapshot
An Operator Splitting View of Federated Learning
inferred← citeshttps://doi.org/10.68381/jca16052openalex-snapshot
A Class of Variable Metric Decomposition Methods for Monotone Variational Inclusions
inferred← citeshttps://doi.org/10.70675/c36217cdz0d6az4daaz9916zc10de7afdbe7openalex-snapshot
On proximal decomposition methods applied to power generation planning in an uncertain environment
inferred← citeshttps://doi.org/10.7551/mitpress/8996.003.0006openalex-snapshot
Incremental Gradient, Subgradient, and Proximal Methods for Convex Optimization: A Survey
inferred← citeshttps://doi.org/10.7936/k7610xjsopenalex-snapshot
A Duality Theory with Zero Duality Gap for Nonlinear Programming
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.