On the public citation graph
Methods of solution of nonlinear extremal problems
0 signed · 113 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.1002/0471787779.ch10openalex-snapshot
Methods of Feasible Directions
inferredcites →https://doi.org/10.1002/nav.3800030109openalex-snapshot
An algorithm for quadratic programming
inferredcites →https://doi.org/10.1016/0016-0032(57)90948-1openalex-snapshot
Modern mathematics for the engineer
inferredcites →https://doi.org/10.1016/0016-0032(60)90869-3openalex-snapshot
Mathematical methods and theory in games, programming and economics
inferredcites →https://doi.org/10.1090/s0002-9904-1943-07818-4openalex-snapshot
Variational methods for the solution of problems of equilibrium and vibrations
inferredcites →https://doi.org/10.1090/s0002-9939-1958-0098426-7openalex-snapshot
A Note on Stochastic Approximation
inferredcites →https://doi.org/10.1214/aoms/1177728659openalex-snapshot
Multidimensional Stochastic Approximation Methods
inferredcites →https://doi.org/10.1214/aoms/1177729392openalex-snapshot
Stochastic Estimation of the Maximum of a Regression Function
inferredcites →https://doi.org/10.1214/aoms/1177729586openalex-snapshot
A Stochastic Approximation Method
inferredcites →https://doi.org/10.2307/1910003openalex-snapshot
Studies in Linear and Nonlinear Programming
inferredcites →https://doi.org/10.2307/2342482openalex-snapshot
Mathematical Methods and Theory in Games, Programming, and Economics.
inferredcites →https://doi.org/10.4153/cjm-1954-038-xopenalex-snapshot
The Relaxation Method for Linear Inequalities
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4772866openalex-extracted
Efficient Equilibrium Flow Calculation in Congested Transportation Networks Using Linearized Model and Lagrangian Relaxation
inferred← citeshttps://doi.org/10.1002/9781394372539.ch6openalex-snapshot
Contemporary Stochastic Quasi‐gradient Algorithms
inferred← citeshttps://doi.org/10.1007/11424925_51openalex-snapshot
Efficient Dual Methods for Nonlinearly Constrained Networks
inferred← citeshttps://doi.org/10.1007/978-1-4612-0245-5_11openalex-snapshot
Algorithms for the Solution of a Large-Scale Single-Controller Stochastic Game
inferred← citeshttps://doi.org/10.1007/978-1-4899-0289-4_16openalex-snapshot
Ergodic Results in Subgradient Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-34910-3_15openalex-snapshot
Mixed-Integer Linear Optimization: Primal–Dual Relations and Dual Subgradient and Cutting-Plane Methods
inferred← citeshttps://doi.org/10.1007/978-3-319-30921-7_2openalex-snapshot
Subgradient Projection Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-72926-8_27openalex-snapshot
SQG-Differential Evolution for Difficult Optimization Problems under a Tight Function Evaluation Budget
inferred← citeshttps://doi.org/10.1007/978-3-540-68279-0_13openalex-snapshot
Reformulation and Decomposition of Integer Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-71056-1_2openalex-snapshot
Data Assimilation for Numerical Weather Prediction: A Review
inferred← citeshttps://doi.org/10.1007/978-3-642-04802-9_21openalex-snapshot
Approximate Subgradient Methods for Lagrangian Relaxations on Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-15558-1_53openalex-snapshot
MRF Inference by k-Fan Decomposition and Tight Lagrangian Relaxation
inferred← citeshttps://doi.org/10.1007/978-3-642-61370-8_6openalex-snapshot
Stochastic Quasigradient Methods
inferred← citeshttps://doi.org/10.1007/978-3-642-82450-0_12openalex-snapshot
Nondifferentiable Optimization
inferred← citeshttps://doi.org/10.1007/bf00934744openalex-snapshot
On a space extension algorithm for nondifferentiable optimization
inferred← citeshttps://doi.org/10.1007/bf00938545openalex-snapshot
On Poljak's improved subgradient method
inferred← citeshttps://doi.org/10.1007/bf00990769openalex-snapshot
On the determination of the minimum of A convex piecewise-differentiable function
inferred← citeshttps://doi.org/10.1007/bf01069005openalex-snapshot
A stochastic method of linearization
inferred← citeshttps://doi.org/10.1007/bf01069322openalex-snapshot
One method of nondifferentiable optimization
inferred← citeshttps://doi.org/10.1007/bf01069664openalex-snapshot
Convergence of algorithms for finding saddle points
inferred← citeshttps://doi.org/10.1007/bf01069670openalex-snapshot
Method of identification in extremal problems
inferred← citeshttps://doi.org/10.1007/bf01069708openalex-snapshot
One problem of production smoothing
inferred← citeshttps://doi.org/10.1007/bf01070389openalex-snapshot
Method of the generalized gradient for finding the absolute minimum of a convex function
inferred← citeshttps://doi.org/10.1007/bf01071091openalex-snapshot
On the method of generalized stochastic gradients and quasi-F�jer sequences
inferred← citeshttps://doi.org/10.1007/bf01071594openalex-snapshot
Complex systems and the solution of extremal problems
inferred← citeshttps://doi.org/10.1007/bf01073969openalex-snapshot
Investigation of stochastic extremal problems by means of functional analysis
inferred← citeshttps://doi.org/10.1007/bf01074504openalex-snapshot
Some methods of stochastic optimization
inferred← citeshttps://doi.org/10.1007/bf01082482openalex-snapshot
Investigation of optimization methods and their applications
inferred← citeshttps://doi.org/10.1007/bf01119998openalex-snapshot
The finite-difference method in optimal control problems
inferred← citeshttps://doi.org/10.1007/bf01120005openalex-snapshot
Application of generalized gradient descent in block programming
inferred← citeshttps://doi.org/10.1007/bf01300861openalex-snapshot
Algorithms for the solution of stochastic dynamic minimax problems
inferred← citeshttps://doi.org/10.1007/bf01583776openalex-snapshot
Modifications and implementation of the ellipsoid algorithm for linear programming
inferred← citeshttps://doi.org/10.1007/bf01584346openalex-snapshot
On convergence rates of subgradient optimization methods
inferred← citeshttps://doi.org/10.1007/bf01584842openalex-snapshot
On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
inferred← citeshttps://doi.org/10.1007/bf01588952openalex-snapshot
Nonlinear programming methods in the presence of noise
inferred← citeshttps://doi.org/10.1007/bf01720281openalex-snapshot
The ellipsoid method and its implications
inferred← citeshttps://doi.org/10.1007/bf02366446openalex-snapshot
Maxmin subject to marginal constraints
inferred← citeshttps://doi.org/10.1007/bf02366513openalex-snapshot
Some directions and results of research in mathematical programming and system analysis
inferred← citeshttps://doi.org/10.1007/bf02733221openalex-snapshot
Main directions in the development of informatics
inferred← citeshttps://doi.org/10.1007/bf02733302openalex-snapshot
To the 70th anniversary of academician V. S. Mikhalevich academician V. S. Mikhalevich as a scientist and science organizer
inferred← citeshttps://doi.org/10.1007/bfb0120698openalex-snapshot
The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices
inferred← citeshttps://doi.org/10.1007/s10107-006-0079-zopenalex-snapshot
Comparison of bundle and classical column generation
inferred← citeshttps://doi.org/10.1007/s10107-007-0147-zopenalex-snapshot
Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities
inferred← citeshttps://doi.org/10.1007/s10107-014-0772-2openalex-snapshot
Primal convergence from dual subgradient methods for convex optimization
inferred← citeshttps://doi.org/10.1007/s10107-016-1055-xopenalex-snapshot
Ergodic, primal convergence in dual subgradient schemes for convex programming, II: the case of inconsistent primal problems
inferred← citeshttps://doi.org/10.1007/s10288-019-00425-xopenalex-snapshot
Essentials of numerical nonsmooth optimization
inferred← citeshttps://doi.org/10.1007/s10479-021-04498-yopenalex-snapshot
Essentials of numerical nonsmooth optimization
inferred← citeshttps://doi.org/10.1007/s10559-017-9989-4openalex-snapshot
Influence of Boris V. Gnedenko’s Probabilistic-Statistical School on the Development of Cybernetics and Informatics
inferred← citeshttps://doi.org/10.1007/s10589-020-00194-yopenalex-snapshot
Convergence rates of subgradient methods for quasi-convex optimization problems
inferred← citeshttps://doi.org/10.1007/s10589-022-00438-zopenalex-snapshot
A subgradient method with non-monotone line search
inferred← citeshttps://doi.org/10.1007/s10898-019-00818-6openalex-snapshot
Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
inferred← citeshttps://doi.org/10.1007/s10898-021-01110-2openalex-snapshot
Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in hilbert spaces
inferred← citeshttps://doi.org/10.1007/s10957-005-7563-0openalex-snapshot
Approximate Subgradient Methods for Nonlinearly Constrained Network Flow Problems
inferred← citeshttps://doi.org/10.1007/s10957-011-9881-8openalex-snapshot
Lagrangian Relaxations on Networks by ε-Subgradient Methods
inferred← citeshttps://doi.org/10.1007/s10957-014-0561-3openalex-snapshot
Convergence of the Surrogate Lagrangian Relaxation Method
inferred← citeshttps://doi.org/10.1007/s10957-022-02014-1openalex-snapshot
Convergence of Inexact Quasisubgradient Methods with Extrapolation
inferred← citeshttps://doi.org/10.1007/s11228-008-0102-zopenalex-snapshot
Strong Convergence of Projected Subgradient Methods for Nonsmooth and Nonstrictly Convex Minimization
inferred← citeshttps://doi.org/10.1007/s12206-019-0740-0openalex-snapshot
Optimal design to reduce torque ripple of IPM motor with radial based function meta-model considering design sensitivity analysis
inferred← citeshttps://doi.org/10.1016/0022-247x(78)90137-3openalex-snapshot
Conditional gradient algorithms with open loop step size rules
inferred← citeshttps://doi.org/10.1016/0191-2615(84)90013-4openalex-snapshot
Game theory and transportation systems modelling
inferred← citeshttps://doi.org/10.1016/j.cnsns.2026.110573openalex-snapshot
Dual averaging algorithm with memory mechanism for nonsmooth optimization problems
inferred← citeshttps://doi.org/10.1016/j.dam.2005.04.013openalex-snapshot
Lagrangean heuristics combined with reoptimization for the 0–1 bidimensional knapsack problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.05.017openalex-snapshot
Inexact subgradient methods for quasi-convex optimization problems
inferred← citeshttps://doi.org/10.1016/j.seta.2025.104382openalex-snapshot
Reconstructing the upwind field of wind turbines using LiDAR data
inferred← citeshttps://doi.org/10.1016/j.trb.2014.11.009openalex-snapshot
A trial-and-error congestion pricing scheme for networks with elastic demand and link capacity constraints
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00252-9openalex-snapshot
On some difficult linear programs coming from set partitioning
inferred← citeshttps://doi.org/10.1016/s0169-7161(05)80131-2openalex-snapshot
7 Mathematical programming — A computational perspective
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00159-xopenalex-snapshot
Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00629-xopenalex-snapshot
On the convergence of conditional ε-subgradient methods for convex programs and convex–concave saddle-point problems
inferred← citeshttps://doi.org/10.1023/a:1012665832688openalex-snapshot
Extension of Subgradient Techniques for Nonsmooth Optimization in Banach Spaces
inferred← citeshttps://doi.org/10.1057/jors.1977.181openalex-snapshot
Mathematical Programming Studies
inferred← citeshttps://doi.org/10.1070/rm1971v026n03abeh003834openalex-snapshot
ON THE THEORY OF NON-LINEAR MINIMAX PROBLEMS
inferred← citeshttps://doi.org/10.1080/01630563.2010.489248openalex-snapshot
The Projected Subgradient Method for Nonsmooth Convex Optimization in the Presence of Computational Errors
inferred← citeshttps://doi.org/10.1080/01630563.2012.706769openalex-snapshot
The Extragradient Method for Convex Optimization in the Presence of Computational Errors
inferred← citeshttps://doi.org/10.1080/01630563.2015.1086788openalex-snapshot
A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems
inferred← citeshttps://doi.org/10.1080/01630563.2021.2001823openalex-snapshot
Incremental Quasi-Subgradient Method for Minimizing Sum of Geodesic Quasi-Convex Functions on Riemannian Manifolds with Applications
inferred← citeshttps://doi.org/10.1080/02331934.2018.1455831openalex-snapshot
Abstract convergence theorem for quasi-convex optimization problems with applications
inferred← citeshttps://doi.org/10.1080/02331934.2020.1745205openalex-snapshot
Weak subgradient method for solving nonsmooth nonconvex optimization problems
inferred← citeshttps://doi.org/10.1080/02331934.2021.1902520openalex-snapshot
Subgradient method with feasible inexact projections for constrained convex optimization problems
inferred← citeshttps://doi.org/10.1080/02331939708844366openalex-snapshot
A dual scheme for traffic assignment problems
inferred← citeshttps://doi.org/10.1080/17442508308833246openalex-snapshot
stochastic quasigradient methods and their application to system optimization †
inferred← citeshttps://doi.org/10.1080/23307706.2015.1129916openalex-snapshot
An efficient approach for solving mixed-integer programming problems under the monotonic condition
inferred← citeshttps://doi.org/10.1109/allerton.2016.7852270openalex-snapshot
Subgradient methods with perturbations in network problems
inferred← citeshttps://doi.org/10.1109/tase.2018.2835298openalex-snapshot
A Scalable Solution Methodology for Mixed-Integer Linear Programming Problems Arising in Automation
inferred← citeshttps://doi.org/10.1137/0311049openalex-snapshot
A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
inferred← citeshttps://doi.org/10.1137/08073038xopenalex-snapshot
A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
inferred← citeshttps://doi.org/10.1155/2021/5513860openalex-snapshot
Ranking Methods for Multicriteria Decision-Making: Application to Benchmarking of Solvers and Problems
inferred← citeshttps://doi.org/10.1287/ijoo.2019.0029openalex-snapshot
Parallelizing Subgradient Methods for the Lagrangian Dual in Stochastic Mixed-Integer Programming
inferred← citeshttps://doi.org/10.1287/moor.1070.0253openalex-snapshot
Hilbert-Valued Perturbed Subgradient Algorithms
inferred← citeshttps://doi.org/10.1287/moor.24.1.237openalex-snapshot
The Efficiency of Ballstep Subgradient Level Methods for Convex Optimization
inferred← citeshttps://doi.org/10.1287/opre.29.6.1039openalex-snapshot
Feature Article—The Ellipsoid Method: A Survey
inferred← citeshttps://doi.org/10.1287/trsc.20.1.37openalex-snapshot
A Conceptual Framework for Optimal Transportation Systems Planning with Integrated Supply and Demand Models
inferred← citeshttps://doi.org/10.15760/etd.831openalex-snapshot
Complex systems and the price-resource directive coordination procedure
inferred← citeshttps://doi.org/10.2478/fcds-2019-0008openalex-snapshot
Benchmarking of Problems and Solvers: a Game-Theoretic Approach
inferred← citeshttps://doi.org/10.31801/cfsuasmas.826316openalex-snapshot
Weak subgradient method with path based target level algorithm for nonconvex optimization
inferred← citeshttps://doi.org/10.3390/a18080469openalex-snapshot
Delayed Star Subgradient Methods for Constrained Nondifferentiable Quasi-Convex Optimization
inferred← citeshttps://doi.org/10.70675/a7f87d0ezb435z40a8z97ecz035cb193f8d2openalex-snapshot
Stochastic approximation and least-squares regression, with applications to machine learning
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.