On the public citation graph
Identifiable Surfaces in Constrained Optimization
0 signed · 91 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/978-3-642-61798-0openalex-snapshot
Elliptic Partial Differential Equations of Second Order
inferredcites →https://doi.org/10.1007/bf00939081openalex-snapshot
On the convergence of projected gradient processes to singular critical points
inferredcites →https://doi.org/10.1007/bf01448362openalex-snapshot
Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities
inferredcites →https://doi.org/10.1090/s0002-9947-1973-0326252-2openalex-snapshot
Smoothness of Certain Metric Projections on Hilbert Space
inferredcites →https://doi.org/10.1090/s0002-9947-1982-0645326-5openalex-snapshot
Differentiability of the Metric Projection in Hilbert Space
inferredcites →https://doi.org/10.1137/0318050openalex-snapshot
Newton’s Method and the Goldstein Step-Length Rule for Constrained Minimization Problems
inferredcites →https://doi.org/10.1137/0322061openalex-snapshot
Two-Metric Projection Methods for Constrained Optimization
inferredcites →https://doi.org/10.1137/0725068openalex-snapshot
On the Identification of Active Constraints
inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis
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-19749-4openalex-snapshot
Sampling Theory, a Renaissance
inferred← citeshttps://doi.org/10.1007/978-3-319-19749-4_3openalex-snapshot
Low Complexity Regularization of Linear Inverse Problems
inferred← citeshttps://doi.org/10.1007/bf02614322openalex-snapshot
Error bounds in mathematical programming
inferred← citeshttps://doi.org/10.1007/s00245-025-10229-7openalex-snapshot
Identification of Active Component Functions in Finite-Max Minimisation via a Smooth Reformulation
inferred← citeshttps://doi.org/10.1007/s00245-026-10410-6openalex-snapshot
A Complexity Analysis Framework for Active Manifold Identification with Applications to $$L_0$$ and $$L_p$$ Regularization Models
inferred← citeshttps://doi.org/10.1007/s10107-011-0484-9openalex-snapshot
Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods
inferred← citeshttps://doi.org/10.1007/s10107-013-0730-4openalex-snapshot
Optimality, identifiability, and sensitivity
inferred← citeshttps://doi.org/10.1007/s10107-015-0943-9openalex-snapshot
A proximal method for composite minimization
inferred← citeshttps://doi.org/10.1007/s10107-018-1238-8openalex-snapshot
On partial smoothness, tilt stability and the $${\mathcal {VU}}$$-decomposition
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/s10107-022-01873-wopenalex-snapshot
Newton acceleration on manifolds identified by proximal-gradient methods
inferred← citeshttps://doi.org/10.1007/s10107-023-02003-wopenalex-snapshot
Stochastic algorithms with geometric step decay converge linearly on sharp functions
inferred← citeshttps://doi.org/10.1007/s10107-024-02109-9openalex-snapshot
On the geometry and refined rate of primal–dual hybrid gradient for linear programming
inferred← citeshttps://doi.org/10.1007/s10107-025-02290-5openalex-snapshot
Gradient descent with adaptive stepsize converges (nearly) linearly under fourth-order growth
inferred← citeshttps://doi.org/10.1007/s10208-021-09516-wopenalex-snapshot
Proximal Methods Avoid Active Strict Saddles of Weakly Convex Functions
inferred← citeshttps://doi.org/10.1007/s10208-024-09652-zopenalex-snapshot
Identifiability, the KL Property in Metric Spaces, and Subgradient Curves
inferred← citeshttps://doi.org/10.1007/s10208-024-09653-yopenalex-snapshot
A Local Nearly Linearly Convergent First-Order Method for Nonsmooth Functions with Quadratic Growth
inferred← citeshttps://doi.org/10.1007/s10208-025-09691-0openalex-snapshot
Active Manifolds, Stratifications, and Convergence to Local Minima in Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/s10463-016-0563-zopenalex-snapshot
The degrees of freedom of partly smooth regularizers
inferred← citeshttps://doi.org/10.1007/s10589-005-3059-4openalex-snapshot
Functions and Sets of Smooth Substructure: Relationships and Examples
inferred← citeshttps://doi.org/10.1007/s10589-007-9139-4openalex-snapshot
A proximal method for identifying active manifolds
inferred← citeshttps://doi.org/10.1007/s10589-011-9412-4openalex-snapshot
Linear convergence analysis of the use of gradient projection methods on total variation problems
inferred← citeshttps://doi.org/10.1007/s10957-017-1061-zopenalex-snapshot
Local Convergence Properties of Douglas–Rachford and Alternating Direction Method of Multipliers
inferred← citeshttps://doi.org/10.1007/s10957-026-02938-yopenalex-snapshot
Complexity Results and Active-Set Identification of a Derivative-Free Method for Bound-Constrained Problems
inferred← citeshttps://doi.org/10.1007/s11075-025-02173-yopenalex-snapshot
Inertial Bregman proximal gradient under partial smoothness
inferred← citeshttps://doi.org/10.1007/s11081-015-9292-zopenalex-snapshot
An S $$\ell _1$$ ℓ 1 LP-active set approach for feasibility restoration in power systems
inferred← citeshttps://doi.org/10.1007/s11228-020-00561-1openalex-snapshot
Nonsmoothness in Machine Learning: Specific Structure, Proximal Identification, and Applications
inferred← citeshttps://doi.org/10.1007/s11590-018-1325-zopenalex-snapshot
“Active-set complexity” of proximal gradient: How long does it take to find the sparsity pattern?
inferred← citeshttps://doi.org/10.1007/s11590-023-01976-zopenalex-snapshot
Local linear convergence of proximal coordinate descent algorithm
inferred← citeshttps://doi.org/10.1016/j.automatica.2008.05.029openalex-snapshot
An inequality constrained nonlinear Kalman–Bucy smoother by interior point likelihood maximization
inferred← citeshttps://doi.org/10.1016/j.cam.2010.01.003openalex-snapshot
An approximate decomposition algorithm for convex minimization
inferred← citeshttps://doi.org/10.1016/j.jmaa.2014.07.041openalex-snapshot
New active set identification for general constrained optimization and minimax problems
inferred← citeshttps://doi.org/10.1016/j.sysconle.2022.105252openalex-snapshot
Asymptotic properties of dual averaging algorithm for constrained distributed stochastic optimization
inferred← citeshttps://doi.org/10.1017/cbo9780511721571.007openalex-snapshot
Eigenvalues and Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1080/02331930600815884openalex-snapshot
Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems
inferred← citeshttps://doi.org/10.1080/02331934.2018.1426584openalex-snapshot
Local linear convergence analysis of Primal–Dual splitting methods
inferred← citeshttps://doi.org/10.1080/10556780410001704902openalex-snapshot
𝒱𝒰-smoothness and proximal point results for some nonconvex functions
inferred← citeshttps://doi.org/10.1080/10556788.2011.638923openalex-snapshot
Derivative-free optimization methods for finite minimax problems
inferred← citeshttps://doi.org/10.1093/imaiai/iav005openalex-snapshot
Model selection with low complexity priors
inferred← citeshttps://doi.org/10.1109/icassp.2016.7472579openalex-snapshot
Local Q-linear convergence and finite-time active set identification of ADMM on a class of penalized regression problems
inferred← citeshttps://doi.org/10.1109/tit.2017.2713822openalex-snapshot
Model Consistency of Partly Smooth Regularizers
inferred← citeshttps://doi.org/10.1109/tsp.2024.3404250openalex-snapshot
On Partial Smoothness, Activity Identification and Faster Algorithms of $L_{1}$ Over $L_{2}$ Minimization
inferred← citeshttps://doi.org/10.1137/050626776openalex-snapshot
Active Set Identification in Nonlinear Programming
inferred← citeshttps://doi.org/10.1137/080729864openalex-snapshot
Identifying Structure of Nonsmooth Convex Functions by the Bundle Technique
inferred← citeshttps://doi.org/10.1137/100808563openalex-snapshot
Accelerated Block-coordinate Relaxation for Regularized Optimization
inferred← citeshttps://doi.org/10.1137/110852103openalex-snapshot
Partial Smoothness, Tilt Stability, and Generalized Hessians
inferred← citeshttps://doi.org/10.1137/130916710openalex-snapshot
Orthogonal Invariance and Identifiability
inferred← citeshttps://doi.org/10.1137/15m1020770openalex-snapshot
Generic Minimizing Behavior in Semialgebraic Optimization
inferred← citeshttps://doi.org/10.1137/16m106340xopenalex-snapshot
Activity Identification and Local Linear Convergence of Forward--Backward-type Methods
inferred← citeshttps://doi.org/10.1137/18m1206953openalex-snapshot
First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants
inferred← citeshttps://doi.org/10.1137/19m1237909openalex-snapshot
Partial Smoothness and Constant Rank
inferred← citeshttps://doi.org/10.1137/19m1309419openalex-snapshot
Active Set Complexity of the Away-Step Frank--Wolfe Algorithm
inferred← citeshttps://doi.org/10.1137/20m1328014openalex-snapshot
Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search
inferred← citeshttps://doi.org/10.1137/20m1347772openalex-snapshot
Distributed Learning with Sparse Communications by Identification
inferred← citeshttps://doi.org/10.1137/22m1510467openalex-snapshot
Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming
inferred← citeshttps://doi.org/10.1137/s0363012994266127openalex-snapshot
On ${\text{L}}^2 $ Sufficient Conditions and the Gradient Projection Method for Optimal Control Problems
inferred← citeshttps://doi.org/10.1137/s1052623401387623openalex-snapshot
Active Sets, Nonsmoothness, and Sensitivity
inferred← citeshttps://doi.org/10.1137/s1052623402412441openalex-snapshot
Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
inferred← citeshttps://doi.org/10.1137/s1052623496305882openalex-snapshot
On the Accurate Identification of Active Constraints
inferred← citeshttps://doi.org/10.1214/19-aos1831openalex-snapshot
Asymptotic optimality in stochastic optimization
inferred← citeshttps://doi.org/10.1214/24-aos2401openalex-snapshot
Asymptotic normality and optimality in nonsmooth stochastic approximation
inferred← citeshttps://doi.org/10.1287/ijoc.11.3.217openalex-snapshot
Mathematical Programming for Data Mining: Formulations and Challenges
inferred← citeshttps://doi.org/10.1287/moor.1110.0481openalex-snapshot
Generic Optimality Conditions for Semialgebraic Convex Programs
inferred← citeshttps://doi.org/10.1287/moor.2020.1075openalex-snapshot
Active‐Set Newton Methods and Partial Smoothness
inferred← citeshttps://doi.org/10.1287/moor.2020.1092openalex-snapshot
Proximal Gradient Methods with Adaptive Subspace Sampling
inferred← citeshttps://doi.org/10.1287/moor.2021.0194openalex-snapshot
Stochastic Subgradient Descent Escapes Active Strict Saddles on Weakly Convex Functions
inferred← citeshttps://doi.org/10.1590/s0101-82052005000200008openalex-snapshot
Numerical results for a globalized active-set Newton method for mixed complementarity problems
inferred← citeshttps://doi.org/10.17877/de290r-3418openalex-snapshot
Manifold Identification in Dual Averaging Methods for Regularized Stochastic Online Learning
inferred← citeshttps://doi.org/10.2172/10141536openalex-snapshot
Research in mathematics and computer science, March 1, 1991--September 30, 1992
inferred← citeshttps://doi.org/10.4208/jcm.2110-m2020-0317openalex-snapshot
A Trust-Region Method for Nonsmooth Nonconvex Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.0901.3117openalex-snapshot
Generic identifiability and second-order sufficiency in tame convex optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1407.5611openalex-snapshot
Local Linear Convergence of Forward-Backward under Partial Smoothness
inferred← citeshttps://doi.org/10.48550/arxiv.2010.00848openalex-snapshot
Nonsmoothness in Machine Learning: specific structure, proximal identification, and applications
inferred← citeshttps://doi.org/10.48550/arxiv.2010.11825openalex-snapshot
Model identification and local linear convergence of coordinate descent
inferred← citeshttps://doi.org/10.5555/2188385.2343699openalex-snapshot
Manifold identification in dual averaging for regularized stochastic online learning
inferred← citeshttps://doi.org/10.68381/jca11017openalex-snapshot
Identifying Active Constraints via Partial Smoothness and Prox-Regularity
inferred← citeshttps://doi.org/10.70675/038cec05z1939z4431z9515z877bcf54b621openalex-snapshot
Ρhase retrieval with nοn-Euclidean Bregman based geοmetry
inferred← citeshttps://doi.org/10.70675/59e22c7czd194z429dz907ez8b079b2c2b24openalex-snapshot
Non-smooth optimization for the estimation of cellular immune components in a tumoral environment
inferred← citeshttps://doi.org/10.70675/7f8093b2z3838z4c0dzb803z4c8519cee4cdopenalex-snapshot
Proximal optimization with automatic dimension reduction for large-scale learning
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.