On the public citation graph
Some remarks on the construction of higher order algorithms in convex optimization
0 signed · 34 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-1-4684-9369-6openalex-snapshot
Geometric Functional Analysis and its Applications
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.1016/0362-546x(82)90106-7openalex-snapshot
Limiting behaviour of the approximate first order and second order directional derivatives for a convex function
inferredcites →https://doi.org/10.1201/9781003064848openalex-snapshot
Necessary Conditions for an Extremum
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-1-4613-3341-8_14openalex-snapshot
Simplified Global Optimality Conditions in Generalized Conjugation Theory
inferred← citeshttps://doi.org/10.1007/978-1-4757-6019-4_10openalex-snapshot
Some Techniques for Finding the Search Direction in Nonsmooth Minimization Problems
inferred← citeshttps://doi.org/10.1007/978-1-4757-6019-4_13openalex-snapshot
From Convex Optimization to Nonconvex Optimization. Necessary and Sufficient Conditions for Global Optimality
inferred← citeshttps://doi.org/10.1007/978-1-4757-6019-4_27openalex-snapshot
The BT-Algorithm for Minimizing a Nonsmooth Functional Subject to Linear Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-51682-5_18openalex-snapshot
Superlinear Convergence in Convex Nondifferentiable 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-82450-0_12openalex-snapshot
Nondifferentiable Optimization
inferred← citeshttps://doi.org/10.1007/978-3-662-12603-5openalex-snapshot
Nondifferentiable Optimization: Motivations and Applications
inferred← citeshttps://doi.org/10.1007/978-3-662-12603-5_17openalex-snapshot
An Algorithm for Convex NDO Based on Properties of the Contour Lines of Convex Quadratic Functions
inferred← citeshttps://doi.org/10.1007/978-3-662-12603-5_3openalex-snapshot
Bundle Methods, Cutting-Plane Algorithms and σ-Newton Directions
inferred← citeshttps://doi.org/10.1007/bf00939609openalex-snapshot
Sensitivity analysis of the greatest eigenvalue of a symmetric matrix via the ?-subdifferential of the associated convex quadratic form
inferred← citeshttps://doi.org/10.1007/bf00940325openalex-snapshot
Limiting behavior of the approximate second-order subdifferential of a convex function
inferred← citeshttps://doi.org/10.1007/bf01397543openalex-snapshot
A constraint linearization method for nondifferentiable convex minimization
inferred← citeshttps://doi.org/10.1007/bf01581270openalex-snapshot
On connections between approximate second-order directional derivative and second-order Dini derivative for convex functions
inferred← citeshttps://doi.org/10.1007/bf01588789openalex-snapshot
A successive quadratic programming method for a class of constrained nonsmooth optimization problems
inferred← citeshttps://doi.org/10.1007/s11228-004-4316-4openalex-snapshot
On the Representation of Approximate Subdifferentials for a Class of Generalized Convex Functions
inferred← citeshttps://doi.org/10.1016/j.ejor.2003.06.030openalex-snapshot
Benefit sharing in holding situations
inferred← citeshttps://doi.org/10.1016/s0169-7161(05)80131-2openalex-snapshot
7 Mathematical programming — A computational perspective
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01008-xopenalex-snapshot
Chapter VII Nondifferentiable optimization
inferred← citeshttps://doi.org/10.1051/ro/1995290201311openalex-snapshot
On a convolution operation obtained by adding level sets : classical and new results
inferred← citeshttps://doi.org/10.1080/02331938608843204openalex-snapshot
An Introduction to the Theory of Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1137/0327039openalex-snapshot
An Ellipsoid Trust Region Bundle Method for Nonsmooth Convex Minimization
inferred← citeshttps://doi.org/10.1137/0329003openalex-snapshot
Quadratic Approximations in Convex Nondifferentiable Optimization
inferred← citeshttps://doi.org/10.1137/0802020openalex-snapshot
Second Derivatives of a Convex Function and of Its Legendre–Fenchel Transformate
inferred← citeshttps://doi.org/10.1137/0804038openalex-snapshot
Sensitivity Analysis of Optimal Value Functions of Convex Parametric Programs with Possibly Empty Solution Sets
inferred← citeshttps://doi.org/10.1137/1029002openalex-snapshot
On the Mathematical Foundations of Nondifferentiable Optimization in Engineering Design
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.