On the public citation graph
Modified Lagrangians in convex programming and their generalizations
0 signed · 82 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.1007/bf00934777openalex-snapshot
The multiplier method of Hestenes and Powell applied to convex programming
inferredcites →https://doi.org/10.1007/bf01580138openalex-snapshot
A dual approach to solving nonlinear programming problems by unconstrained optimization
inferredcites →https://doi.org/10.1109/cdc.1973.269203openalex-snapshot
Multiplier methods for convex programming
inferredcites →https://doi.org/10.1137/0314020openalex-snapshot
Combined Primal–Dual and Penalty Methods for Convex Programming
inferredcites →https://doi.org/10.1137/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
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.31857/s04247388openalex-snapshot
Economics and Mathematical Methods
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-3-642-51682-5_27openalex-snapshot
Non-Cooperative Games; Methods of Subgradient Projection and Proximal Point
inferred← citeshttps://doi.org/10.1007/bf01442200openalex-snapshot
Two general methods for computing saddle points with applications for decomposing convex programming problems
inferred← citeshttps://doi.org/10.1007/bf01580598openalex-snapshot
On the convergence of the exponential multiplier method for convex programming
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/bfb0120836openalex-snapshot
Point-to-Set Maps and Mathematical Programming
inferred← citeshttps://doi.org/10.1007/s00025-025-02512-4openalex-snapshot
An alternating inertial method for the inclusion problem and applications
inferred← citeshttps://doi.org/10.1007/s10107-014-0826-5openalex-snapshot
The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
inferred← citeshttps://doi.org/10.1007/s10107-021-01643-0openalex-snapshot
Accelerated proximal point method for maximally monotone operators
inferred← citeshttps://doi.org/10.1007/s10440-009-9502-9openalex-snapshot
Modified Extragradient Methods for a System of Variational Inequalities in Banach Spaces
inferred← citeshttps://doi.org/10.1007/s10589-013-9564-5openalex-snapshot
A customized proximal point algorithm for convex minimization with linear constraints
inferred← citeshttps://doi.org/10.1007/s10589-013-9616-xopenalex-snapshot
Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
inferred← citeshttps://doi.org/10.1007/s10589-018-9992-3openalex-snapshot
The generalized proximal point algorithm with step size 2 is not necessarily convergent
inferred← citeshttps://doi.org/10.1007/s10589-019-00091-zopenalex-snapshot
On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective
inferred← citeshttps://doi.org/10.1007/s10589-020-00221-yopenalex-snapshot
Convergence rates for an inexact ADMM applied to separable convex optimization
inferred← citeshttps://doi.org/10.1007/s10589-024-00643-yopenalex-snapshot
An inexact ADMM for separable nonconvex and nonsmooth optimization
inferred← citeshttps://doi.org/10.1007/s10851-012-0347-xopenalex-snapshot
Convex Relaxation of a Class of Vertex Penalizing Functionals
inferred← citeshttps://doi.org/10.1007/s10851-017-0709-5openalex-snapshot
An Algorithmic Framework of Generalized Primal–Dual Hybrid Gradient Methods for Saddle Point Problems
inferred← citeshttps://doi.org/10.1007/s10898-022-01241-0openalex-snapshot
Weak and strong convergence of generalized proximal point algorithms with relaxed parameters
inferred← citeshttps://doi.org/10.1007/s10915-017-0477-9openalex-snapshot
On the Optimal Linear Convergence Rate of a Generalized Proximal Point Algorithm
inferred← citeshttps://doi.org/10.1007/s10957-014-0567-xopenalex-snapshot
Convergence Analysis of the Generalized Alternating Direction Method of Multipliers with Logarithmic–Quadratic Proximal Regularization
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/s10957-018-1265-xopenalex-snapshot
Lagrangian Penalization Scheme with Parallel Forward–Backward Splitting
inferred← citeshttps://doi.org/10.1007/s10957-018-1338-xopenalex-snapshot
On Glowinski’s Open Question on the Alternating Direction Method of Multipliers
inferred← citeshttps://doi.org/10.1007/s11075-019-00819-2openalex-snapshot
Convergence study on the proximal alternating direction method with larger step size
inferred← citeshttps://doi.org/10.1007/s11228-020-00541-5openalex-snapshot
New inertial factors of the Krasnosel’skiı-Mann iteration
inferred← citeshttps://doi.org/10.1007/s11425-013-4683-0openalex-snapshot
A proximal point algorithm revisit on the alternating direction method of multipliers
inferred← citeshttps://doi.org/10.1007/s11590-017-1195-9openalex-snapshot
A parameterized proximal point algorithm for separable convex optimization
inferred← citeshttps://doi.org/10.1007/s12532-015-0078-2openalex-snapshot
Generalized alternating direction method of multipliers: new theoretical insights and applications
inferred← citeshttps://doi.org/10.1016/j.apnum.2019.08.008openalex-snapshot
Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: Convergence analysis
inferred← citeshttps://doi.org/10.1016/j.apnum.2023.06.015openalex-snapshot
A variable projection method for large-scale inverse problems with ℓ1 regularization
inferred← citeshttps://doi.org/10.1016/j.cam.2007.06.013openalex-snapshot
On convergence criteria of generalized proximal point algorithms
inferred← citeshttps://doi.org/10.1016/j.cam.2015.03.037openalex-snapshot
Semidefinite inverse eigenvalue problems with prescribed entries and partial eigendata
inferred← citeshttps://doi.org/10.1016/j.cnsns.2024.108010openalex-snapshot
A second order dynamical system method for solving a maximally comonotone inclusion problem
inferred← citeshttps://doi.org/10.1016/j.jmaa.2007.07.019openalex-snapshot
Weak convergence of a projection algorithm for variational inequalities in a Banach space
inferred← citeshttps://doi.org/10.1016/j.mcm.2011.02.016openalex-snapshot
Strong convergence of an iterative algorithm for variational inequalities in Banach spaces
inferred← citeshttps://doi.org/10.1080/02331930512331331610openalex-snapshot
Convergence analysis of a relaxed extragradient–proximal point algorithm application to variational inequalities
inferred← citeshttps://doi.org/10.1080/10556780801995790openalex-snapshot
Relaxed proximal point algorithms for variational inequalities with multi-valued operators
inferred← citeshttps://doi.org/10.1088/0266-5611/29/7/075011openalex-snapshot
Applications of the alternating direction method of multipliers to the semidefinite inverse quadratic eigenvalue problem with a partial eigenstructure
inferred← citeshttps://doi.org/10.1088/0266-5611/32/11/115011openalex-snapshot
Linearized primal-dual methods for linear inverse problems with total variation regularization and finite element discretization
inferred← citeshttps://doi.org/10.1088/1361-6420/ace548openalex-snapshot
A two-stage numerical approach for the sparse initial source identification of a diffusion–advection equation *
inferred← citeshttps://doi.org/10.1090/mcom/3822openalex-snapshot
A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programming
inferred← citeshttps://doi.org/10.1109/cac.2015.7382469openalex-snapshot
Solving Lasso: Extended ADMM is more efficient than ADMM
inferred← citeshttps://doi.org/10.1109/jsac.2017.2720918openalex-snapshot
On the Energy-Efficiency of Hybrid Analog–Digital Transceivers for Single- and Multi-Carrier Large Antenna Array Systems
inferred← citeshttps://doi.org/10.1109/tccn.2019.2933423openalex-snapshot
Hybrid Analog-Digital Transceiver Designs for Multi-User MIMO mmWave Cognitive Radio Systems
inferred← citeshttps://doi.org/10.1109/tgcn.2020.3026725openalex-snapshot
Joint Bit Allocation and Hybrid Beamforming Optimization for Energy Efficient Millimeter Wave MIMO Systems
inferred← citeshttps://doi.org/10.1109/tpami.2023.3296408openalex-snapshot
Versatile Weight Attack via Flipping Limited Bits
inferred← citeshttps://doi.org/10.1137/070681399openalex-snapshot
Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
inferred← citeshttps://doi.org/10.1137/0804031openalex-snapshot
Partial Proximal Minimization Algorithms for Convex Pprogramming
inferred← citeshttps://doi.org/10.1137/120886753openalex-snapshot
Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
inferred← citeshttps://doi.org/10.1137/13090849xopenalex-snapshot
A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
inferred← citeshttps://doi.org/10.1137/16m1078604openalex-snapshot
Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming
inferred← citeshttps://doi.org/10.1137/s1052623403427859openalex-snapshot
Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
inferred← citeshttps://doi.org/10.1155/2010/246808openalex-snapshot
Strong Convergence Theorem for a New General System of Variational Inequalities in Banach Spaces
inferred← citeshttps://doi.org/10.1155/2012/237083openalex-snapshot
Extended Extragradient Methods for Generalized Variational Inequalities
inferred← citeshttps://doi.org/10.1155/2013/912846openalex-snapshot
Convergence Analysis of the Relaxed Proximal Point Algorithm
inferred← citeshttps://doi.org/10.1155/fpta/2006/35390openalex-snapshot
Weak convergence of an iterative sequence for accretive operators in Banach spaces
inferred← citeshttps://doi.org/10.1186/1687-1812-2011-26openalex-snapshot
Another weak convergence theorems for accretive mappings in banach spaces
inferred← citeshttps://doi.org/10.1186/s13660-016-1095-zopenalex-snapshot
An inexact generalized PRSM with LQP regularization for structured variational inequalities and its applications to traffic equilibrium problems
inferred← citeshttps://doi.org/10.1186/s13660-017-1405-0openalex-snapshot
A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming
inferred← citeshttps://doi.org/10.12677/pm.2021.114062openalex-snapshot
Solving Separable Convex Optimization Problem Based on Generalized Proximal Alternating Direction Method of Multipliers
inferred← citeshttps://doi.org/10.1287/moor.1050.0156openalex-snapshot
Convergence of a Hybrid Projection-Proximal Point Algorithm Coupled with Approximation Methods in Convex Optimization
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/9781601984616openalex-snapshot
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
inferred← citeshttps://doi.org/10.23919/acc.2019.8814892openalex-snapshot
Distributed Reinforcement Learning with ADMM-RL
inferred← citeshttps://doi.org/10.24193/fpt-ro.2018.1.09openalex-snapshot
A strongly convergent modification of the proximal point algorithm in nonsmooth Banach spaces
inferred← citeshttps://doi.org/10.28919/afpt/3394openalex-snapshot
A new algorithm for variational inequality problems with alpha-inverse strongly monotone maps and common fixed points for a countable family of relatively weak nonexpansive maps, with applications
inferred← citeshttps://doi.org/10.3390/cells11091512openalex-snapshot
Fourier Ptychographic Microscopy via Alternating Direction Method of Multipliers
inferred← citeshttps://doi.org/10.4064/bc92-0-20openalex-snapshot
Convergence theorems by hybrid projection methods for Lipschitz-continuous monotone mappings and a countable family of nonexpansive mappings
inferred← citeshttps://doi.org/10.4208/nmtma.2018.m1621openalex-snapshot
Adaptive Parallel Primal-Dual Method for Saddle Point Problems
inferred← citeshttps://doi.org/10.47749/t/unicamp.2013.904563openalex-snapshot
Algoritmo do ponto proximal para operadores não monótonos
inferred← citeshttps://doi.org/10.48550/arxiv.1604.02494openalex-snapshot
Inexact alternating direction multiplier methods for separable convex optimization
inferred← citeshttps://doi.org/10.48550/arxiv.2108.08554openalex-snapshot
Balanced Augmented Lagrangian Method for Convex Programming
inferred← citeshttps://doi.org/10.5802/smai-jcm.30openalex-snapshot
The augmented Lagrangian method with full Jacobian decomposition and logarithmic-quadratic proximal regularization for multiple-block separable convex programming
inferred← citeshttps://doi.org/10.5802/smai-jcm.6openalex-snapshot
Block-wise Alternating Direction Method of Multipliers for Multiple-block Convex Programming and Beyond
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.