On the public citation graph
Second order necessary and sufficient conditions for convex composite NDO
0 signed · 64 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/bf01394449openalex-snapshot
Discrete, nonlinear approximation problems in polyhedral norms
inferredcites →https://doi.org/10.1007/bf01394450openalex-snapshot
Discrete, nonlinear approximation problems in polyhedral norms
inferredcites →https://doi.org/10.1007/bf01580725openalex-snapshot
Second-order necessary conditions in semismooth optimization
inferredcites →https://doi.org/10.1007/bf01584377openalex-snapshot
Descent methods for composite nondifferentiable optimization problems
inferredcites →https://doi.org/10.1007/bf01585095openalex-snapshot
Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
inferredcites →https://doi.org/10.1007/bf01585659openalex-snapshot
Local properties of algorithms for minimizing nonsmooth composite functions
inferredcites →https://doi.org/10.1007/bf02591866openalex-snapshot
Marginal values and second-order necessary conditions for optimality
inferredcites →https://doi.org/10.1007/bf02591998openalex-snapshot
On the global convergence of trust region algorithms for unconstrained minimization
inferredcites →https://doi.org/10.1007/bfb0120957openalex-snapshot
Optimality conditions for piecewise smooth functions
inferredcites →https://doi.org/10.1007/bfb0120959openalex-snapshot
A model algorithm for composite nondifferentiable optimization problems
inferredcites →https://doi.org/10.1137/0317019openalex-snapshot
Necessary and Sufficient Conditions for a Local Minimum. 1: A Reduction Theorem and First Order Conditions
inferredcites →https://doi.org/10.1137/0317020openalex-snapshot
Necessary and Sufficient Conditions for a Local Minimum. 2: Conditions of Levitin–Miljutin–Osmolovskii Type
inferredcites →https://doi.org/10.1137/0317021openalex-snapshot
Necessary and Sufficient Conditions for a Local Minimum. 3: Second Order Conditions and Augmented Duality
inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis
inferredcites →https://doi.org/10.1287/moor.11.4.632openalex-snapshot
A Gauss-Newton Approach to Solving Generalized Inequalities
inferredcites →https://doi.org/10.1287/moor.13.4.660openalex-snapshot
Second-Order Sufficient Conditions in Nonsmooth Optimization
inferredcites →https://doi.org/10.25405/ncl.34123965openalex-snapshot
The Numerical Solution of Nonlinear Problems
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_66openalex-snapshot
Composite Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_82openalex-snapshot
Composite Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4757-6019-4_22openalex-snapshot
Perturbation of Generalized Kuhn-Tucker Points in Finite-Dimensional Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_82-1openalex-snapshot
Composite Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-51682-5_5openalex-snapshot
Second-Order Generalized Derivatives: Comparisons of Two Types of Epi-Derivatives
inferred← citeshttps://doi.org/10.1007/978-3-642-57014-8_25openalex-snapshot
Recent Advances on Second-Order Optimality Conditions
inferred← citeshttps://doi.org/10.1007/978-94-015-8330-5_7openalex-snapshot
Towards Second-Order Methods for Structured Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/bf00962796openalex-snapshot
Optimality conditions for piecewiseC 2 nonlinear programming
inferred← citeshttps://doi.org/10.1007/bf01580087openalex-snapshot
Second-order global optimality conditions for convex composite optimization
inferred← citeshttps://doi.org/10.1007/bf01581075openalex-snapshot
Optimality conditions for non-finite valued convex composite functions
inferred← citeshttps://doi.org/10.1007/bf01581251openalex-snapshot
Convex composite multi-objective nonsmooth programming
inferred← citeshttps://doi.org/10.1007/bf01587090openalex-snapshot
An inexact algorithm for composite nondifferentiable optimization
inferred← citeshttps://doi.org/10.1007/bf02192162openalex-snapshot
Convex composite minimization withC 1,1 functions
inferred← citeshttps://doi.org/10.1007/s10107-019-01441-9openalex-snapshot
The subdifferential of measurable composite max integrands and smoothing approximation
inferred← citeshttps://doi.org/10.1007/s101070100249openalex-snapshot
On convergence of the Gauss-Newton method for convex composite optimization
inferred← citeshttps://doi.org/10.1007/s10957-010-9666-5openalex-snapshot
Second-Order Analysis of Penalty Function
inferred← citeshttps://doi.org/10.1007/s10957-026-02935-1openalex-snapshot
Convergence of Linearized Proximal Algorithms with Adaptive Stepsizes for Convex Composite Optimization
inferred← citeshttps://doi.org/10.1016/0022-247x(89)90111-xopenalex-snapshot
A sequential quadratic programming method for potentially infeasible mathematical programs
inferred← citeshttps://doi.org/10.1016/0022-247x(91)90312-nopenalex-snapshot
Variational analysis of a composite function: A formula for the lower second order epi-derivative
inferred← citeshttps://doi.org/10.1016/0362-546x(94)90218-6openalex-snapshot
Generalized second-order derivatives and optimality conditions
inferred← citeshttps://doi.org/10.1017/s1446181100013419openalex-snapshot
Minimal approximate Hessians for continuously Gâteaux differentiable functions
inferred← citeshttps://doi.org/10.1023/a:1017513905271openalex-snapshot
Nonlinear Lagrangian Theory for Nonconvex Optimization
inferred← citeshttps://doi.org/10.1023/a:1022929826650openalex-snapshot
Partially Strictly Monotone and Nonlinear Penalty Functions for Constrained Mathematical Programs
inferred← citeshttps://doi.org/10.1090/s0002-9947-1988-0936806-9openalex-snapshot
First- and Second-Order Epi-Differentiability in Nonlinear Programming
inferred← citeshttps://doi.org/10.1109/tac.2011.2141430openalex-snapshot
An $\ell _{1}$-Laplace Robust Kalman Smoother
inferred← citeshttps://doi.org/10.1137/0329054openalex-snapshot
An Exact Penalization Viewpoint of Constrained Optimization
inferred← citeshttps://doi.org/10.1137/0804001openalex-snapshot
On Sensitivity Analysis of Nonlinear Programs in Banach Spaces: The Approach via Composite Unconstrained Optimization
inferred← citeshttps://doi.org/10.1137/120889812openalex-snapshot
Epi-convergent Smoothing with Applications to Convex Composite Functions
inferred← citeshttps://doi.org/10.1137/130918320openalex-snapshot
An Inexact Sequential Quadratic Optimization Algorithm for Nonlinear Optimization
inferred← citeshttps://doi.org/10.1137/130918861openalex-snapshot
Robust and Trend-Following Student's t Kalman Smoothers
inferred← citeshttps://doi.org/10.1137/130950239openalex-snapshot
Iterative Reweighted Linear Least Squares for Exact Penalty Subproblems on Product Sets
inferred← citeshttps://doi.org/10.1137/140993090openalex-snapshot
On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications
inferred← citeshttps://doi.org/10.1137/17m1151031openalex-snapshot
Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems
inferred← citeshttps://doi.org/10.1137/18m1234473openalex-snapshot
Nonlinear Eigenvector Methods for Convex Minimization over the Numerical Range
inferred← citeshttps://doi.org/10.1137/21m1410063openalex-snapshot
High-Order Optimization Methods for Fully Composite Problems
inferred← citeshttps://doi.org/10.1137/s0363012996311095openalex-snapshot
Second-Order Conditions for Optimization Problems with Constraints
inferred← citeshttps://doi.org/10.1137/s1052623401396509openalex-snapshot
Sharp Variational Conditions for Convex Composite Nonsmooth Functions
inferred← citeshttps://doi.org/10.1137/s1052623496309296openalex-snapshot
Tilt Stability of a Local Minimum
inferred← citeshttps://doi.org/10.11650/twjm/1500405392openalex-snapshot
EXTENDED NEWTON’S METHOD FOR MAPPINGS ON RIEMANNIAN MANIFOLDS WITH VALUES IN A CONE
inferred← citeshttps://doi.org/10.1287/moor.14.3.462openalex-snapshot
Second-Order Optimality Conditions in Nonlinear Programming Obtained by Way of Epi-Derivatives
inferred← citeshttps://doi.org/10.1287/moor.2017.0889openalex-snapshot
Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
inferred← citeshttps://doi.org/10.1287/moor.2019.1027openalex-snapshot
Strong Metric (Sub)regularity of Karush–Kuhn–Tucker Mappings for Piecewise Linear-Quadratic Convex-Composite Optimization and the Quadratic Convergence of Newton’s Method
inferred← citeshttps://doi.org/10.1287/moor.2020.1099openalex-snapshot
A Study of Convex Convex-Composite Functions via Infimal Convolution with Applications
inferred← citeshttps://doi.org/10.19139/soic.v4i2.171openalex-snapshot
Second-order optimality and duality in vector optimization over cones
inferred← citeshttps://doi.org/10.48550/arxiv.1806.05218openalex-snapshot
Line Search and Trust-Region Methods for Convex-Composite 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.