On the public citation graph
A view of line-searches
0 signed · 89 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/bf01397884openalex-snapshot
�ber die globale Konvergenz von Variable-Metrik-Verfahren mit nicht-exakter Schrittweitenbestimmung
inferredcites →https://doi.org/10.1007/bf01584320openalex-snapshot
Optimization of lipschitz continuous functions
inferredcites →https://doi.org/10.1007/bf01589328openalex-snapshot
Variable metric methods for minimizing a class of nondifferentiable functions
inferredcites →https://doi.org/10.1007/bf01609012openalex-snapshot
A subgradient algorithm for certain minimax and minisum problems
inferredcites →https://doi.org/10.1007/bf02260741openalex-snapshot
Effiziente Schrittweitenfunktionen bei unrestringierten Optimierungsaufgaben
inferredcites →https://doi.org/10.1007/bfb0120700openalex-snapshot
An extension of davidon methods to non differentiable problems
inferredcites →https://doi.org/10.1007/bfb0120703openalex-snapshot
A method of conjugate subgradients for minimizing nondifferentiable functions
inferredcites →https://doi.org/10.1016/b978-0-12-597050-1.50008-7openalex-snapshot
Some Algorithms Based on the Principle of Feasible Directions
inferredcites →https://doi.org/10.1090/s0002-9947-1975-0367131-6openalex-snapshot
Generalized Gradients and Applications
inferredcites →https://doi.org/10.1090/s0025-5718-1974-0343581-1openalex-snapshot
A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
inferredcites →https://doi.org/10.1093/comjnl/13.3.317openalex-snapshot
A new approach to variable metric algorithms
inferredcites →https://doi.org/10.1093/imamat/16.3.321openalex-snapshot
An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear Equations
inferredcites →https://doi.org/10.1137/0315061openalex-snapshot
Semismooth and Semiconvex Functions in Constrained Optimization
inferredcites →https://doi.org/10.1137/1011036openalex-snapshot
Convergence Conditions for Ascent Methods
inferredcites →https://doi.org/10.1287/moor.2.2.191openalex-snapshot
An Algorithm for Constrained Optimization with Semismooth Functions
inferredcites →https://doi.org/10.1287/moor.3.3.244openalex-snapshot
Conjugate Gradient Methods with Inexact Searches
inferredcites →https://doi.org/10.2140/pjm.1966.16.1openalex-snapshot
Minimization of functions having Lipschitz continuous first partial derivatives
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0183openalex-snapshot
Nonlinear Conjugate Gradient Methods
inferred← citeshttps://doi.org/10.1007/0-387-25486-2_3openalex-snapshot
Vehicle Routing Problem with Time Windows
inferred← citeshttps://doi.org/10.1007/978-1-4419-6594-3_28openalex-snapshot
Computer Algebra and Line Search
inferred← citeshttps://doi.org/10.1007/978-1-4613-3335-7_4openalex-snapshot
Piecewise Line-search Techniques for Constrained Minimization by Quasi-newton Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-08720-2_2openalex-snapshot
Fundamentals on Unconstrained Optimization. Stepsize Computation
inferred← citeshttps://doi.org/10.1007/978-3-211-48243-8_5openalex-snapshot
Mathematical Programs with Equilibrium Constraints: Theory and Numerical Methods
inferred← citeshttps://doi.org/10.1007/978-3-319-51317-1_2openalex-snapshot
Introduction to Nonlinear Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-59073-3_6openalex-snapshot
ε-Intervals in Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-61370-8_4openalex-snapshot
Nonlinear Programming Techniques Applied to Stochastic Programs with Recourse
inferred← citeshttps://doi.org/10.1007/978-3-642-82450-0_12openalex-snapshot
Nondifferentiable Optimization
inferred← citeshttps://doi.org/10.1007/bf00940519openalex-snapshot
Descent algorithm for a class of convex nondifferentiable functions
inferred← citeshttps://doi.org/10.1007/bf01581138openalex-snapshot
Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
inferred← citeshttps://doi.org/10.1007/bf01585170openalex-snapshot
Convergence of some algorithms for convex minimization
inferred← citeshttps://doi.org/10.1007/bf01585756openalex-snapshot
A family of variable metric proximal methods
inferred← citeshttps://doi.org/10.1007/bf01589113openalex-snapshot
Some numerical experiments with variable-storage quasi-Newton algorithms
inferred← citeshttps://doi.org/10.1007/bf01594922openalex-snapshot
Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization
inferred← citeshttps://doi.org/10.1007/bf02023050openalex-snapshot
Parallel bundle-based decomposition for large-scale structured mathematical programming problems
inferred← citeshttps://doi.org/10.1007/bf02591738openalex-snapshot
An active set method for solving linearly constrained nonsmooth optimization problems
inferred← citeshttps://doi.org/10.1007/bf02614390openalex-snapshot
Variable metric bundle methods: From conceptual to implementable forms
inferred← citeshttps://doi.org/10.1007/bfb0042224openalex-snapshot
A step-size selection procedure for equality constrained optimization
inferred← citeshttps://doi.org/10.1007/s00211-009-0228-4openalex-snapshot
Piecewise linear approximations in nonconvex nonsmooth optimization
inferred← citeshttps://doi.org/10.1007/s10107-012-0514-2openalex-snapshot
Nonsmooth optimization via quasi-Newton methods
inferred← citeshttps://doi.org/10.1007/s10288-019-00425-xopenalex-snapshot
Essentials of numerical nonsmooth optimization
inferred← citeshttps://doi.org/10.1007/s10589-015-9801-1openalex-snapshot
A Dai–Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions
inferred← citeshttps://doi.org/10.1007/s10589-025-00667-yopenalex-snapshot
Convergence of ease-controlled random reshuffling gradient algorithms under Lipschitz smoothness
inferred← citeshttps://doi.org/10.1007/s10957-006-9123-7openalex-snapshot
Modification of the Wolfe Line Search Rules to Satisfy the Descent Condition in the Polak-Ribière-Polyak Conjugate Gradient Method
inferred← citeshttps://doi.org/10.1007/s11075-006-9023-9openalex-snapshot
An acceleration of gradient descent algorithm with backtracking for unconstrained optimization
inferred← citeshttps://doi.org/10.1007/s11075-009-9350-8openalex-snapshot
Accelerated gradient descent methods with line search
inferred← citeshttps://doi.org/10.1007/s11075-017-0460-4openalex-snapshot
Hybridization of accelerated gradient descent method
inferred← citeshttps://doi.org/10.1007/s11228-018-0470-yopenalex-snapshot
A Note on the Morozov Principle via Lagrange Duality
inferred← citeshttps://doi.org/10.1007/s11590-024-02110-3openalex-snapshot
An improvement of the Goldstein line search
inferred← citeshttps://doi.org/10.1007/s12532-015-0086-2openalex-snapshot
A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
inferred← citeshttps://doi.org/10.1016/b978-0-08-037869-5.50011-xopenalex-snapshot
A Generalized Reduced Gradient Algorithm for Solving Large-Scale Discrete-Time Nonlinear Optimal Control Problems
inferred← citeshttps://doi.org/10.1016/b978-0-12-468662-5.50015-xopenalex-snapshot
ON A BUNDLE ALGORITHM FOR NONSMOOTH OPTIMIZATION
inferred← citeshttps://doi.org/10.1016/j.cor.2006.11.006openalex-snapshot
Formulations and exact algorithms for the vehicle routing problem with time windows
inferred← citeshttps://doi.org/10.1016/j.ejor.2009.01.033openalex-snapshot
A linear programming-based optimization algorithm for solving nonlinear programming problems
inferred← citeshttps://doi.org/10.1016/j.nahs.2015.11.002openalex-snapshot
Projection-based iterative mode scheduling for switched systems
inferred← citeshttps://doi.org/10.1017/s0962492900002270openalex-snapshot
Theory of algorithms for unconstrained optimization
inferred← citeshttps://doi.org/10.1023/a:1008224107486openalex-snapshot
Global Interval Methods for Local Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1023/a:1022685908429openalex-snapshot
Direct Approach to the Minimization of the Maximal Stress over an Arch Structure
inferred← citeshttps://doi.org/10.1080/02331934.2016.1147037openalex-snapshot
An implementation of a reduced subgradient method via Luenberger-Mokhtar variant
inferred← citeshttps://doi.org/10.1080/02331934.2020.1777124openalex-snapshot
Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems
inferred← citeshttps://doi.org/10.1080/03052159108941009openalex-snapshot
NON-LINEAR OPTIMIZATION AND LARGE-SCALE PROBLEMS
inferred← citeshttps://doi.org/10.1109/cdc.2012.6426270openalex-snapshot
Projection-based switched system optimization: Absolute continuity of the line search
inferred← citeshttps://doi.org/10.1109/cdc.2013.6760724openalex-snapshot
Projection-based optimal mode scheduling
inferred← citeshttps://doi.org/10.1109/tmi.2007.905820openalex-snapshot
A Fast Nonrigid Image Registration With Constraints on the Jacobian Using Large Scale Constrained Optimization
inferred← citeshttps://doi.org/10.1137/030601880openalex-snapshot
A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
inferred← citeshttps://doi.org/10.1137/0802003openalex-snapshot
Global Convergence Properties of Conjugate Gradient Methods for Optimization
inferred← citeshttps://doi.org/10.1137/0802008openalex-snapshot
A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
inferred← citeshttps://doi.org/10.1137/1.9781611970920openalex-snapshot
Iterative Methods for Optimization
inferred← citeshttps://doi.org/10.1137/21m1464178openalex-snapshot
Riemannian Conjugate Gradient Methods: General Framework and Specific Algorithms with Convergence Analyses
inferred← citeshttps://doi.org/10.1137/21m1467365openalex-snapshot
Semismoothness for Solution Operators of Obstacle-Type Variational Inequalities with Applications in Optimal Control
inferred← citeshttps://doi.org/10.1137/s1052623401391907openalex-snapshot
Solving Multicommodity Flow Problems by an Approximation Scheme
inferred← citeshttps://doi.org/10.1137/s1052623402411459openalex-snapshot
Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
inferred← citeshttps://doi.org/10.1137/s1052623493259604openalex-snapshot
On the Realization of the Wolfe Conditions in Reduced Quasi-Newton Methods for Equality Constrained Optimization
inferred← citeshttps://doi.org/10.1145/192115.192132openalex-snapshot
Line search algorithms with guaranteed sufficient decrease
inferred← citeshttps://doi.org/10.1145/3342104openalex-snapshot
A Wolfe Line Search Algorithm for Vector Optimization
inferred← citeshttps://doi.org/10.1155/2013/147025openalex-snapshot
A Globally Convergent Hybrid Conjugate Gradient Method and Its Numerical Behaviors
inferred← citeshttps://doi.org/10.1155/2014/279891openalex-snapshot
A Hybrid of DL and WYL Nonlinear Conjugate Gradient Methods
inferred← citeshttps://doi.org/10.1155/2014/710376openalex-snapshot
A Modified Conjugacy Condition and Related Nonlinear Conjugate Gradient Method
inferred← citeshttps://doi.org/10.1155/2014/965104openalex-snapshot
Accelerated Double Direction Method for Solving Unconstrained Optimization Problems
inferred← citeshttps://doi.org/10.1190/1.1444544openalex-snapshot
2-D and 3-D interpretation of electrical tomography measurements; Part 2, The inverse problem
inferred← citeshttps://doi.org/10.1287/opre.45.3.395openalex-snapshot
An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
inferred← citeshttps://doi.org/10.2298/fil2427701popenalex-snapshot
Hybrid optimization models based on S-iteration process
inferred← citeshttps://doi.org/10.3233/inf-1998-9404openalex-snapshot
Parallel Implementation of a Generalized Conjugate Gradient Algorithm
inferred← citeshttps://doi.org/10.3390/min10050471openalex-snapshot
Three-Dimensional Regularized Focusing Migration: A Case Study from the Yucheng Mining Area, Shandong, China
inferred← citeshttps://doi.org/10.70675/46c5936az4e4ez48b6za3b4zac6c9051f6b6openalex-snapshot
Étude et optimisations de jets photoniques pour des applications non conventionnelles dans les domaines optique et hyperfréquences
inferred← citeshttps://doi.org/10.70675/dd3348a6z9fc9z404fza299z02a2868b39e7openalex-snapshot
Modélisation, optimisation et simulation des réseaux de distribution d'électricité
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.