On the public citation graph

Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions

https://doi.org/10.1007/bf01585109
0 signed · 43 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/bf01386389openalex-snapshot
Newton's method for convex programming and Tchebycheff approximation
inferredcites →https://doi.org/10.1007/bf02254861openalex-snapshot
Steplength algorithms for minimizing a class of nondifferentiable functions
inferredcites →https://doi.org/10.1007/bfb0120960openalex-snapshot
A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
inferredcites →https://doi.org/10.1137/0108053openalex-snapshot
The Cutting-Plane Method for Solving Convex Programs
inferredcites →https://doi.org/10.1201/b10651-28openalex-snapshot
Nonsmooth Optimization
inferredcites →https://doi.org/10.1287/moor.8.2.185openalex-snapshot
A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex 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-1-4757-3226-9_12openalex-snapshot
Functions with Primal-Dual Gradient Structure and u-Hessians
inferred← citeshttps://doi.org/10.1007/978-3-030-34910-3_9openalex-snapshot
Beyond First Order: V U $$\mathcal {V}\mathcal {U}$$ -Decomposition Methods
inferred← citeshttps://doi.org/10.1007/978-3-642-45780-7_11openalex-snapshot
VU-Decomposition Derivatives for Convex Max-Functions
inferred← citeshttps://doi.org/10.1007/bf00939671openalex-snapshot
Extension of the Frank-Wolfe algorithm to concave nondifferentiable objective functions
inferred← citeshttps://doi.org/10.1007/bf00940519openalex-snapshot
Descent algorithm for a class of convex nondifferentiable functions
inferred← citeshttps://doi.org/10.1007/bf00941285openalex-snapshot
Decomposition method of descent for minimizing the sum of convex nonsmooth functions
inferred← citeshttps://doi.org/10.1007/bf01391417openalex-snapshot
A quadratic approximation method for minimizing a class of quasidifferentiable functions
inferred← citeshttps://doi.org/10.1007/bf01580733openalex-snapshot
An implementation of an algorithm for univariate minimization and an application to nested optimization
inferred← citeshttps://doi.org/10.1007/bf01582285openalex-snapshot
A bracketing technique to ensure desirable convergence in univariate minimization
inferred← citeshttps://doi.org/10.1007/bf01584377openalex-snapshot
Descent methods for composite nondifferentiable optimization problems
inferred← citeshttps://doi.org/10.1007/bf01585172openalex-snapshot
A rapidly convergent five-point algorithm for univariate minimization
inferred← citeshttps://doi.org/10.1007/bf01585734openalex-snapshot
Relaxation methods for monotropic programs
inferred← citeshttps://doi.org/10.1007/bf01588792openalex-snapshot
On superlinear convergence in univariate nonsmooth minimization
inferred← citeshttps://doi.org/10.1007/bf02204821openalex-snapshot
Bounding separable recourse functions with limited distribution information
inferred← citeshttps://doi.org/10.1007/bf02591883openalex-snapshot
A descent algorithm for nonsmooth convex optimization
inferred← citeshttps://doi.org/10.1007/bf02592098openalex-snapshot
A quasi-second-order proximal bundle algorithm
inferred← citeshttps://doi.org/10.1007/bf02612712openalex-snapshot
Stationarity and superlinear convergence of an algorithm for univariate locally lipschitz constrained minimization
inferred← citeshttps://doi.org/10.1007/bf02614389openalex-snapshot
Separating plane algorithms for convex optimization
inferred← citeshttps://doi.org/10.1007/bfb0008905openalex-snapshot
Better than linear convergence and safeguarding in nonsmooth minimization
inferred← citeshttps://doi.org/10.1007/bfb0120960openalex-snapshot
A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
inferred← citeshttps://doi.org/10.1007/bfb0121185openalex-snapshot
An implementation of an algorithm for univariate minimization and an application to nested optimization
inferred← citeshttps://doi.org/10.1007/s10107-005-0630-3openalex-snapshot
A -algorithm for convex minimization
inferred← citeshttps://doi.org/10.1007/s10589-018-0030-2openalex-snapshot
A fast gradient and function sampling method for finite-max functions
inferred← citeshttps://doi.org/10.1016/j.amc.2003.08.058openalex-snapshot
Convergence of line search methods for unconstrained optimization
inferred← citeshttps://doi.org/10.1023/a:1022630801549openalex-snapshot
Convergence Analysis of Some Methods for Minimizing a Nonsmooth Convex Function
inferred← citeshttps://doi.org/10.1080/10556789508805624openalex-snapshot
A quadratically convergent line-search algorithm for pice wise smooth convex optimization
inferred← citeshttps://doi.org/10.1109/tac.1983.1103136openalex-snapshot
Optimal short-term scheduling of large-scale power systems
inferred← citeshttps://doi.org/10.1109/tit.2014.2301162openalex-snapshot
Sparse Recovery With Unknown Variance: A LASSO-Type Approach
inferred← citeshttps://doi.org/10.1137/0328011openalex-snapshot
Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
inferred← citeshttps://doi.org/10.1137/s1052623499350967openalex-snapshot
On $\mathcalVU$-theory for Functions with Primal-Dual Gradient Structure
inferred← citeshttps://doi.org/10.1287/moor.22.2.326openalex-snapshot
Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
inferred← citeshttps://doi.org/10.1287/moor.8.2.185openalex-snapshot
A Superlinearly Convergent Algorithm for One-Dimensional Constrained Minimization Problems with Convex Functions
inferred← citeshttps://doi.org/10.1515/1569395054069008openalex-snapshot
A new class of memory gradient methods with inexact line searches
inferred← citeshttps://doi.org/10.21236/ada219504openalex-snapshot
Bounding Separable Recourse Functions with Limited Distribution Information
inferred← citeshttps://doi.org/10.48550/arxiv.1101.0434openalex-snapshot
Sparse recovery with unknown variance: a LASSO-type approach
inferred← citeshttps://doi.org/10.68381/jca12005openalex-snapshot
Relating U-Lagrangians to Second-Order Epi-Derivatives and Proximal Tracks
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.