On the public citation graph

Convergence of diagonally stationary sequences in convex optimization

0 signed · 38 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/978-3-0348-9369-5openalex-snapshot

Functional Analysis and Approximation

inferredcites →https://doi.org/10.1007/978-3-642-51682-5_4openalex-snapshot

About the Convergence of the Proximal Method

inferredcites →https://doi.org/10.1007/bf00939042openalex-snapshot

Penalty-proximal methods in convex programming

inferredcites →https://doi.org/10.1007/bf01371085openalex-snapshot

Metrically well-set minimization problems

inferredcites →https://doi.org/10.1007/bf01442140openalex-snapshot

On equiwellset minimum problems

inferredcites →https://doi.org/10.1007/bf01586942openalex-snapshot

Penalization in non-classical convex programming via variational convergence

inferredcites →https://doi.org/10.1007/bfb0006503openalex-snapshot

On equiwellset minimum problems

inferredcites →https://doi.org/10.1016/s0294-1449(17)30017-3openalex-snapshot

Well Behaved Asymptotical Convex Functions

inferredcites →https://doi.org/10.1051/m2an/197105r101171openalex-snapshot

Sur la minimisation de fonctionnelles convexes par pénalisation

inferredcites →https://doi.org/10.1051/m2an/1978120201531openalex-snapshot

Perturbation des méthodes d'optimisation. Applications

inferredcites →https://doi.org/10.1137/0311013openalex-snapshot

Sur un Procede d’Optimisation Utilisant Simultanement les Methodes de Penalisation et des Variations Locales. I

inferredcites →https://doi.org/10.1137/0311014openalex-snapshot

Sur un Procede d’Optimisation Utilisant Simultanement les Methodes de Penalisation et des Variations locales. II

inferredcites →https://doi.org/10.1137/0803034openalex-snapshot

Convex Functions with Unbounded Level Sets and Applications to Duality Theory

inferredcites →https://doi.org/10.83129/toubkal-5016openalex-snapshot

Quelques résultats de stabilité en analyse épigraphique : Approche topologique et quantitative

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-46823-0_20openalex-snapshot

On the Convergence of Some Iterative Methods for Convex Minimization

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/s00211-023-01390-8openalex-snapshot

Iterative regularization for low complexity regularizers

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/s10957-024-02564-6openalex-snapshot

On the Convergence of Proximal Gradient Methods for Convex Simple Bilevel Optimization

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:1020840322436openalex-snapshot

Well-Posedness by Perturbations of Variational Problems

inferred← citeshttps://doi.org/10.1023/a:1022687412779openalex-snapshot

Conditioning and Upper-Lipschitz Inverse Subdifferentials in Nonsmooth Optimization Problems

inferred← citeshttps://doi.org/10.1080/02331934.2011.592528openalex-snapshot

Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods

inferred← citeshttps://doi.org/10.1088/1361-6420/adb06fopenalex-snapshot

Iterative regularization in classification via hinge loss diagonal descent

inferred← citeshttps://doi.org/10.1088/1361-6501/aa9260openalex-snapshot

Controlled wavelet domain sparsity for x-ray tomography

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/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/19m1308888openalex-snapshot

Accelerated Iterative Regularization via Dual Diagonal Descent

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.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.1515/jiip-2023-0009openalex-snapshot

Fast iterative regularization by reusing data

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.68381/jca01005openalex-snapshot

Bounded Diagonally Stationary Sequences in Convex Optimization

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.