On the public citation graph

Finite perturbation of convex programs

https://doi.org/10.1007/bf01442401
0 signed · 43 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/978-3-642-46631-1_11openalex-snapshot
Serial and Parallel Solution of Large Scale Linear Programs by Augmented Lagrangian Successive Overrelaxation
inferredcites →https://doi.org/10.1007/bf01584647openalex-snapshot
Exact penalty functions in nonlinear programming
inferredcites →https://doi.org/10.1007/bf01588250openalex-snapshot
Exact penalty functions in nonlinear programming
inferredcites →https://doi.org/10.1007/bfb0121017openalex-snapshot
Normal solutions of linear programs
inferredcites →https://doi.org/10.1016/0167-6377(88)90047-8openalex-snapshot
A simple characterization of solution sets of convex programs
inferredcites →https://doi.org/10.1016/0167-6377(91)90087-6openalex-snapshot
Characterization of solution sets of convex programs
inferredcites →https://doi.org/10.1017/cbo9781316341599.012openalex-snapshot
Introduction to Optimization
inferredcites →https://doi.org/10.1093/oso/9780195057294.003.0014openalex-snapshot
Least Norm Solution Of Nonmonotone Linear Complementarity Problems
inferredcites →https://doi.org/10.1137/0120021openalex-snapshot
A Necessary and Sufficient Qualification for Constrained Optimization
inferredcites →https://doi.org/10.1137/0307016openalex-snapshot
Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
inferredcites →https://doi.org/10.1137/0317052openalex-snapshot
Nonlinear Perturbation of Linear Programs
inferredcites →https://doi.org/10.1137/1015075openalex-snapshot
A Review of Constraint Qualifications in Finite-Dimensional Spaces
inferredcites →https://doi.org/10.2307/2006360openalex-snapshot
Solutions of Ill-Posed Problems.
inferredcites →https://doi.org/10.31857/s04247388openalex-snapshot
Economics and Mathematical Methods
inferredcites →https://doi.org/10.5860/choice.26-5109openalex-snapshot
Introduction to optimization

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-319-09955-2_22openalex-snapshot
An Entropic Perturbation Approach to TV-Minimization for Limited-Data Tomography
inferred← citeshttps://doi.org/10.1007/978-3-642-45780-7_15openalex-snapshot
Error Bounds for Regularized Complementarity Problems
inferred← citeshttps://doi.org/10.1007/bf01187901openalex-snapshot
Finding normal solutions in piecewise linear programming
inferred← citeshttps://doi.org/10.1007/s002459900090openalex-snapshot
Relaxation Methods for Strictly Convex Regularizations of Piecewise Linear Programs
inferred← citeshttps://doi.org/10.1007/s10107-013-0708-2openalex-snapshot
A first order method for finding minimal norm-like solutions of convex optimization problems
inferred← citeshttps://doi.org/10.1007/s10589-019-00104-xopenalex-snapshot
On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems
inferred← citeshttps://doi.org/10.1016/0167-6377(91)90087-6openalex-snapshot
Characterization of solution sets of convex programs
inferred← citeshttps://doi.org/10.1023/a:1008625410523openalex-snapshot
Convergence and Error Bound for Perturbation of Linear Programs
inferred← citeshttps://doi.org/10.1080/02331934.2021.1939336openalex-snapshot
Combining approximation and exact penalty in hierarchical programming
inferred← citeshttps://doi.org/10.1080/02331934.2023.2192232openalex-snapshot
A first-order method for solving bilevel convex optimization problems in Banach space
inferred← citeshttps://doi.org/10.1080/10556788.2019.1619729openalex-snapshot
An inertial extrapolation method for convex simple bilevel optimization
inferred← citeshttps://doi.org/10.1080/10556788.2022.2117356openalex-snapshot
Linear programming with nonparametric penalty programs and iterated thresholding
inferred← citeshttps://doi.org/10.1137/060675320openalex-snapshot
Exact Regularization of Convex Programs
inferred← citeshttps://doi.org/10.1137/090760350openalex-snapshot
Analysis and Generalizations of the Linearized Bregman Method
inferred← citeshttps://doi.org/10.1137/11085236xopenalex-snapshot
Exact Regularization of Polyhedral Norms
inferred← citeshttps://doi.org/10.1137/16m105592xopenalex-snapshot
A First Order Method for Solving Convex Bilevel Optimization Problems
inferred← citeshttps://doi.org/10.1137/17m1152474openalex-snapshot
On Stochastic and Deterministic Quasi-Newton Methods for Nonstrongly Convex Optimization: Asymptotic Convergence and Rate Analysis
inferred← citeshttps://doi.org/10.1137/21m1462775openalex-snapshot
Robust Accelerated Primal-Dual Methods for Computing Saddle Points
inferred← citeshttps://doi.org/10.1137/23m1589402openalex-snapshot
Improved Guarantees for Optimal Nash Equilibrium Seeking and Bilevel Variational Inequalities
inferred← citeshttps://doi.org/10.1186/s13660-023-03039-4openalex-snapshot
The forward–backward splitting method for finding the minimum like-norm solution of the mixed variational inequality problem
inferred← citeshttps://doi.org/10.1287/educ.2018.0191openalex-snapshot
Stochastic Gradient Descent: Recent Trends
inferred← citeshttps://doi.org/10.1287/ijoc.11.3.217openalex-snapshot
Mathematical Programming for Data Mining: Formulations and Challenges
inferred← citeshttps://doi.org/10.1590/s1807-03022010000200004openalex-snapshot
Error bound for a perturbed minimization problem related with the sum of smallest eigenvalues
inferred← citeshttps://doi.org/10.1609/aaai.v36i7.20706openalex-snapshot
A Fully Single Loop Algorithm for Bilevel Optimization without Hessian Inverse
inferred← citeshttps://doi.org/10.4236/jamp.2025.134084openalex-snapshot
Convergence Rate Analysis of Modified BiG-SAM for Solving Bi-Level Optimization Problems Based on S-FISTA
inferred← citeshttps://doi.org/10.48550/arxiv.1702.03999openalex-snapshot
A First Order Method for Solving Convex Bi-Level Optimization Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1901.09506openalex-snapshot
An iterative regularized mirror descent method for ill-posed nondifferentiable stochastic optimization
inferred← citeshttps://doi.org/10.48550/arxiv.2009.00690openalex-snapshot
Improved Bilevel Model: Fast and Optimal Algorithm with Theoretical Guarantee
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.