On the public citation graph

Penalization in non-classical convex programming via variational convergence

https://doi.org/10.1007/bf01586942
0 signed · 52 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-0348-9297-1_12openalex-snapshot
Coupling optimization methods and variational convergence
inferredcites →https://doi.org/10.1007/bf00939042openalex-snapshot
Penalty-proximal methods in convex programming
inferredcites →https://doi.org/10.1007/bfb0121157openalex-snapshot
Numerical methods for nondifferentiable convex optimization
inferredcites →https://doi.org/10.1090/s0002-9947-1986-0837797-xopenalex-snapshot
Isometries for the Legendre-Fenchel Transform
inferredcites →https://doi.org/10.1137/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis
inferredcites →https://doi.org/10.24033/bsmf.1625openalex-snapshot
Proximité et dualité dans un espace hilbertien

What points at this work

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

inferred← citeshttps://doi.org/10.1007/0-306-48332-7_204openalex-snapshot
Sensitivity and stability in NLP ILL-POSED VARIATIONAL PROBLEMS
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_273openalex-snapshot
Ill-posed Variational Problems
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-3-030-54621-2_273-1openalex-snapshot
Ill-posed Variational Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-13710-0openalex-snapshot
Convex Optimization in Normed Spaces: Theory, Methods and Examples
inferred← citeshttps://doi.org/10.1007/978-3-319-69404-7_12openalex-snapshot
Decomposition Descent Method for Limit Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-51682-5_21openalex-snapshot
Iterative Processes for Solving Incorrect Convex Variational Problems
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-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_11openalex-snapshot
Which Fixed Point Does the Iteration Method Select?
inferred← citeshttps://doi.org/10.1007/bf01027092openalex-snapshot
Convergence of diagonally stationary sequences in convex optimization
inferred← citeshttps://doi.org/10.1007/bf01096742openalex-snapshot
Iterative processes for solving incorrect convex variational problems
inferred← citeshttps://doi.org/10.1007/bf01204180openalex-snapshot
The perturbed proximal point algorithm and some of its applications
inferred← citeshttps://doi.org/10.1007/bf01416609openalex-snapshot
Coupling proximal methods and variational convergence
inferred← citeshttps://doi.org/10.1007/s10107-002-0295-0openalex-snapshot
Primal and dual convergence of a proximal point exponential penalty method for linear programming
inferred← citeshttps://doi.org/10.1007/s10107-013-0640-5openalex-snapshot
VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks
inferred← citeshttps://doi.org/10.1007/s10851-017-0754-0openalex-snapshot
Iterative Regularization via Dual Diagonal Descent
inferred← citeshttps://doi.org/10.1007/s11228-014-0293-4openalex-snapshot
An Inexact Penalty Method for Non Stationary Generalized Variational Inequalities
inferred← citeshttps://doi.org/10.1007/s11228-017-0447-2openalex-snapshot
Selective Bi-coordinate Method for Limit Non-Smooth Resource Allocation Type Problems
inferred← citeshttps://doi.org/10.1007/s11590-019-01455-4openalex-snapshot
Application of the penalty method to limit quasi-equilibrium problems
inferred← citeshttps://doi.org/10.1016/j.na.2009.03.010openalex-snapshot
Proximal point method and elliptic regularization
inferred← citeshttps://doi.org/10.1016/j.na.2013.07.015openalex-snapshot
Application of penalty methods to non-stationary variational inequalities
inferred← citeshttps://doi.org/10.1023/a:1008321423879openalex-snapshot
Proximal Point Methods and Nonconvex Optimization
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:1022621905645openalex-snapshot
Coupling the Proximal Point Algorithm with Approximation Methods
inferred← citeshttps://doi.org/10.1023/a:1022693618829openalex-snapshot
Proximal Methods in View of Interior-Point Strategies
inferred← citeshttps://doi.org/10.1051/m2an/1994280201891openalex-snapshot
The perturbed Tikhonov's algorithm and some of its applications
inferred← citeshttps://doi.org/10.1080/02331934.2023.2264861openalex-snapshot
On the diagonal proximal point algorithms
inferred← citeshttps://doi.org/10.1080/02331939208843853openalex-snapshot
A regularized penalty method for solving convex semi-infinite programs
inferred← citeshttps://doi.org/10.1080/02331939508844053openalex-snapshot
Survey of penalty, exact-penalty and multiplier methods from 1968 to 1993
inferred← citeshttps://doi.org/10.1080/02331939508844083openalex-snapshot
Multi-step-prox-regularization method for solving convex variation problems
inferred← citeshttps://doi.org/10.1080/02331939908844430openalex-snapshot
Proximal interior point approach in convex programming (ill-posed problems)*†
inferred← citeshttps://doi.org/10.1109/cdc57313.2025.11312639openalex-snapshot
Tikhonov regularized exterior penalty methods for hierarchical variational inequalities
inferred← citeshttps://doi.org/10.1137/0329045openalex-snapshot
A Perturbed Parallel Decomposition Method for a Class of Nonsmooth Convex Minimization Problems
inferred← citeshttps://doi.org/10.1137/100789464openalex-snapshot
Prox-Penalization and Splitting Methods for Constrained Variational Problems
inferred← citeshttps://doi.org/10.1137/110820300openalex-snapshot
Coupling Forward-Backward with Penalty Schemes and Parallel Splitting for Constrained Variational Inequalities
inferred← citeshttps://doi.org/10.1137/s0363012998333116openalex-snapshot
Proximal Point Approach and Approximation of Variational Inequalities
inferred← citeshttps://doi.org/10.1137/s1052623401397242openalex-snapshot
Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm
inferred← citeshttps://doi.org/10.1137/s105262340343467xopenalex-snapshot
Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical Minimization
inferred← citeshttps://doi.org/10.1155/2020/3108056openalex-snapshot
Theoretical Aspect of Diagonal Bregman Proximal Methods
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.3103/s1066369x14080064openalex-snapshot
Application of the penalty method to nonstationary approximation of an optimization problem
inferred← citeshttps://doi.org/10.3103/s1066369x17100061openalex-snapshot
Two-level iterative method for non-stationary mixed variational inequalities
inferred← citeshttps://doi.org/10.68381/jca01005openalex-snapshot
Bounded Diagonally Stationary Sequences in Convex Optimization
inferred← citeshttps://doi.org/10.68381/jca16015openalex-snapshot
Asymptotic Convergence to the Optimal Value of Diagonal Proximal Iterations in Convex Minimization
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.