On the public citation graph

Variable metric methods for minimizing a class of nondifferentiable functions

https://doi.org/10.1007/bf01589328
0 signed · 103 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/bf00932858openalex-snapshot
A globally convergent method for nonlinear programming
inferredcites →https://doi.org/10.1007/bf01580395openalex-snapshot
Superlinearly convergent variable metric algorithms for general nonlinear programming problems
inferredcites →https://doi.org/10.1007/bfb0067703openalex-snapshot
A fast algorithm for nonlinearly constrained optimization calculations
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-468660-1.50008-6openalex-snapshot
A HYBRID METHOD FOR NONLINEAR PROGRAMMING11This research is supported in part by National Science Foundation under Grant ENG 77-02647.
inferredcites →https://doi.org/10.1093/comjnl/12.1.63openalex-snapshot
An Algorithm for Minimax Approximation in the Nonlinear Case
inferredcites →https://doi.org/10.1137/0114053openalex-snapshot
The Theory of Max-Min, with Applications
inferredcites →https://doi.org/10.1137/0315037openalex-snapshot
Dual Variable Metric Algorithms for Constrained Optimization
inferredcites →https://doi.org/10.1137/1.9780898719468openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.1137/1019005openalex-snapshot
Quasi-Newton Methods, Motivation and Theory
inferredcites →https://doi.org/10.2307/2004942openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.2307/2005981openalex-snapshot
Introduction to Minimax

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/num.1690090604openalex-snapshot
Optimal m‐stage Runge‐Kutta schemes for steady‐state solutions of hyperbolic equations
inferred← citeshttps://doi.org/10.1007/978-1-4612-0245-5_10openalex-snapshot
Convergent Stepsizes for Constrained Min-Max Algorithms
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-72557-9_107openalex-snapshot
Algorithmen zur Losung Eines Diskreten Minimax Problemes — Ein Wertender Überblick
inferred← citeshttps://doi.org/10.1007/978-94-015-8372-5_7openalex-snapshot
Robust Min-max Decisions with Rival Models
inferred← citeshttps://doi.org/10.1007/978-981-10-3614-9_17openalex-snapshot
Generalized Project Gradient Algorithm for Solving Constrained Minimax Problems
inferred← citeshttps://doi.org/10.1007/bf00933937openalex-snapshot
Global convergence of quasi-Newton-type algorithms for some nonsmooth optimization problems
inferred← citeshttps://doi.org/10.1007/bf00939377openalex-snapshot
Nonmonotone line search for minimax problems
inferred← citeshttps://doi.org/10.1007/bf00940519openalex-snapshot
Descent algorithm for a class of convex nondifferentiable functions
inferred← citeshttps://doi.org/10.1007/bf00940574openalex-snapshot
An algorithm for composite nonsmooth optimization problems
inferred← citeshttps://doi.org/10.1007/bf00940683openalex-snapshot
Superlinearly convergent algorithm for min-max problems
inferred← citeshttps://doi.org/10.1007/bf00940928openalex-snapshot
Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems
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/bf01580609openalex-snapshot
A smooth method for the finite minimax problem
inferred← citeshttps://doi.org/10.1007/bf01581171openalex-snapshot
Discontinuous piecewise linear optimization
inferred← citeshttps://doi.org/10.1007/bf01585707openalex-snapshot
A constrained min‐max algorithm for rival models of the same economic system
inferred← citeshttps://doi.org/10.1007/bf01586049openalex-snapshot
A barrier function method for minimax problems
inferred← citeshttps://doi.org/10.1007/bf01743341openalex-snapshot
A minimax reduction method for multi-objective decomposition-based design optimization
inferred← citeshttps://doi.org/10.1007/bf01935647openalex-snapshot
Corrected sequential linear programming for sparse minimax optimization
inferred← citeshttps://doi.org/10.1007/bf02108465openalex-snapshot
A projected conjugate gradient method for sparse minimax problems
inferred← citeshttps://doi.org/10.1007/bf02240210openalex-snapshot
A compact variable metric algorithm for nonlinear minimax approximation
inferred← citeshttps://doi.org/10.1007/bfb0004506openalex-snapshot
A view of line-searches
inferred← citeshttps://doi.org/10.1007/bfb0007547openalex-snapshot
A Superlinearly Convergent Method of Feasible Directions for Optimization Problems Arising in the Design of Engineering Systems
inferred← citeshttps://doi.org/10.1007/bfb0093151openalex-snapshot
Second order corrections for non-differentiable optimization
inferred← citeshttps://doi.org/10.1007/bfb0120959openalex-snapshot
A model algorithm for composite nondifferentiable optimization problems
inferred← citeshttps://doi.org/10.1007/bfb0121123openalex-snapshot
Algorithms for stochastic programs: The case of nonstochastic tenders
inferred← citeshttps://doi.org/10.1007/s10255-007-0380-5openalex-snapshot
A New Superlinearly Convergent SQP Algorithm for Nonlinear Minimax Problems
inferred← citeshttps://doi.org/10.1007/s10479-008-0401-7openalex-snapshot
A hybrid algorithm for nonlinear minimax problems
inferred← citeshttps://doi.org/10.1007/s10479-012-1274-3openalex-snapshot
A hybrid algorithm for linearly constrained minimax problems
inferred← citeshttps://doi.org/10.1007/s10589-018-0009-zopenalex-snapshot
A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities
inferred← citeshttps://doi.org/10.1007/s11276-006-6533-2openalex-snapshot
Distributed self-tuning of sensor networks
inferred← citeshttps://doi.org/10.1016/0066-4138(85)90480-xopenalex-snapshot
Interaction, specification refinement, and tradeoff exploration in optimization-based design of engineering systems
inferred← citeshttps://doi.org/10.1016/0377-2217(82)90110-2openalex-snapshot
An algorithm for solving linearly constrained minimax problems
inferred← citeshttps://doi.org/10.1016/b978-0-08-031665-9.50030-4openalex-snapshot
INTERACTION, SPECIFICATION REFINEMENT, AND TRADEOFF EXPLORATION IN OPTIMIZATION-BASED DESIGN OF ENGINEERING SYSTEMS
inferred← citeshttps://doi.org/10.1016/b978-0-08-035738-6.50012-4openalex-snapshot
ASPECTS OF OPTIMIZATION-BASED CADCS
inferred← citeshttps://doi.org/10.1016/b978-0-12-012736-8.50007-3openalex-snapshot
Methods for Optimal Economic Policy Design
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/b978-0-444-50617-7.50004-5openalex-snapshot
Approximation in normed linear spaces
inferred← citeshttps://doi.org/10.1016/j.amc.2007.10.070openalex-snapshot
A smoothing trust-region Newton-CG method for minimax problem
inferred← citeshttps://doi.org/10.1016/j.aml.2008.06.017openalex-snapshot
An improved SQP algorithm for solving minimax problems
inferred← citeshttps://doi.org/10.1016/j.jmaa.2009.06.009openalex-snapshot
A modified SQP algorithm for minimax problems
inferred← citeshttps://doi.org/10.1016/j.jmaa.2009.08.046openalex-snapshot
A sequential quadratically constrained quadratic programming method for unconstrained minimax problems
inferred← citeshttps://doi.org/10.1016/s0165-1889(99)00088-3openalex-snapshot
Robust min–max portfolio strategies for rival forecast and risk scenarios
inferred← citeshttps://doi.org/10.1016/s0377-0427(00)00333-2openalex-snapshot
Approximation in normed linear spaces
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)40517-9openalex-snapshot
An Approach to Continuous Minimax: The Basic Algorithm
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)47133-3openalex-snapshot
A Discrete Min-Max Algorithm: Risk Management with Rival Scenarios
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)54929-0openalex-snapshot
Aspects of Optimization-based CADCS
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)60931-5openalex-snapshot
Interaction, Specification Refinement, and Tradeoff Exploration in Optimization-based Design of Engineering Systems
inferred← citeshttps://doi.org/10.1017/s0004972700038673openalex-snapshot
Generalised monotone line search algorithm for degenerate nonlinear minimax problems
inferred← citeshttps://doi.org/10.1017/s0004972700039745openalex-snapshot
A sequential quadratic programming algorithm for nonlinear minimax problems
inferred← citeshttps://doi.org/10.1023/a:1018601319372openalex-snapshot
A Global Regularization Method for Solving the Finite Min-Max Problem
inferred← citeshttps://doi.org/10.1023/b:jota.0000006685.60019.3eopenalex-snapshot
Algorithms with Adaptive Smoothing for Finite Minimax Problems
inferred← citeshttps://doi.org/10.1080/01630563.2013.873454openalex-snapshot
A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem
inferred← citeshttps://doi.org/10.1080/02331934.2020.1751843openalex-snapshot
An aggregate homotopy method for solving unconstrained minimax problems
inferred← citeshttps://doi.org/10.1080/03052159208941026openalex-snapshot
AN ENTROPY-BASED AGGREGATE METHOD FOR MINIMAX OPTIMIZATION
inferred← citeshttps://doi.org/10.1109/cdc.1983.269656openalex-snapshot
Convergence rates of Quasi-Newton algorithms for some non-smooth optimization problems
inferred← citeshttps://doi.org/10.1109/cdc.1988.194731openalex-snapshot
Domain rescaling techniques for the solution of affinely parametrized nondifferentiable optimal design problems
inferred← citeshttps://doi.org/10.1109/cdc.1989.70250openalex-snapshot
A superlinearly convergent algorithm for min-max problems
inferred← citeshttps://doi.org/10.1109/cso.2012.64openalex-snapshot
Truncated Newton Method for Solving Minimax Problems
inferred← citeshttps://doi.org/10.1109/icassp.1982.1171816openalex-snapshot
The use of multiple criterion optimization for the simultaneous phase and magnitude design of IIR digital filters
inferred← citeshttps://doi.org/10.1109/iccet.2010.5485989openalex-snapshot
Notice of Retraction: SQP trust-region algorithm for finite minimax problems
inferred← citeshttps://doi.org/10.1109/tassp.1986.1164875openalex-snapshot
Digital signal restoration using fuzzy sets
inferred← citeshttps://doi.org/10.1109/tmtt.1985.1133249openalex-snapshot
A Superlinearly Convergent Minimax Algorithm for Microwave Circuit Design
inferred← citeshttps://doi.org/10.1137/0323026openalex-snapshot
Convergence Rates of Quasi-Newton Algorithms for Some Nonsmooth Optimization Problems
inferred← citeshttps://doi.org/10.1137/0325037openalex-snapshot
Dual Techniques for Minimax
inferred← citeshttps://doi.org/10.1137/0326019openalex-snapshot
A Parallel Algorithm for a Class of Convex Programs
inferred← citeshttps://doi.org/10.1137/0326071openalex-snapshot
Smooth Optimization Methods for Minimax Problems
inferred← citeshttps://doi.org/10.1137/0330023openalex-snapshot
On the Extension of Newton’s Method to Semi-Infinite Minimax Problems
inferred← citeshttps://doi.org/10.1137/0727095openalex-snapshot
A Regularization Method for Solving the Finite Convex Min-Max Problem
inferred← citeshttps://doi.org/10.1137/0729072openalex-snapshot
Avoiding the Maratos Effect by Means of a Nonmonotone Line Search. II. Inequality Constrained Problems—Feasible Iterates
inferred← citeshttps://doi.org/10.1137/0801006openalex-snapshot
Minimization of Locally Lipschitzian Functions
inferred← citeshttps://doi.org/10.1137/0802013openalex-snapshot
A Structure-Exploiting Algorithm for Nonlinear Minimax Problems
inferred← citeshttps://doi.org/10.1137/0806025openalex-snapshot
An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
inferred← citeshttps://doi.org/10.1137/0901025openalex-snapshot
A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
inferred← citeshttps://doi.org/10.1137/0902018openalex-snapshot
A Projected Lagrangian Algorithm for Nonlinear $l_1 $ Optimization
inferred← citeshttps://doi.org/10.1137/0910036openalex-snapshot
An Efficient Trust Region Algorithm for Minimizing Nondifferentiable Composite Functions
inferred← citeshttps://doi.org/10.1137/0910039openalex-snapshot
Sequential Quadratic Programming Methods Based on Approximating a Projected Hessian Matrix
inferred← citeshttps://doi.org/10.1137/s1052623498344562openalex-snapshot
A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
inferred← citeshttps://doi.org/10.1137/s1056263493260386openalex-snapshot
An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
inferred← citeshttps://doi.org/10.1142/s0217595915400011openalex-snapshot
An Adaptive Smoothing Method for Continuous Minimax Problems
inferred← citeshttps://doi.org/10.1145/35078.42322openalex-snapshot
The expanding equilibrium algorithm
inferred← citeshttps://doi.org/10.1145/383738.383740openalex-snapshot
Algorithm 811: NDA
inferred← citeshttps://doi.org/10.1145/66888.66891openalex-snapshot
Constrained nonlinear least squares: an exact penalty approach with projected structured quasi-Newton updates
inferred← citeshttps://doi.org/10.1155/2014/436415openalex-snapshot
A QP-Free Algorithm for Finite Minimax Problems
inferred← citeshttps://doi.org/10.1515/9781400825110openalex-snapshot
Algorithms for Worst-Case Design and Applications to Risk Management
inferred← citeshttps://doi.org/10.18642/jmsaa_7100121786openalex-snapshot
A TRUST REGION FILTER METHOD FOR MINIMAX PROBLEMS
inferred← citeshttps://doi.org/10.21136/am.1986.104215openalex-snapshot
Dual method for solving a special problem of quadratic programming as a subproblem at nonlinear minimax approximation
inferred← citeshttps://doi.org/10.3390/math11183949openalex-snapshot
Algebraic Solution of Tropical Best Approximation Problems
inferred← citeshttps://doi.org/10.3934/jimo.2014.10.637openalex-snapshot
Substitution secant/finite difference method to large sparse minimax problems
inferred← citeshttps://doi.org/10.4208/jcm.1109-m3567openalex-snapshot
A New Trust-Region Algorithm for Finite Minimax Problem
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.