On the public citation graph
Utilization of the operation of space dilatation in the minimization of convex functions
0 signed · 95 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.2307/2003785openalex-snapshot
Computational Methods of Linear Algebra
inferredcites →https://doi.org/10.2307/2004234openalex-snapshot
Computational Methods of Linear Algebra.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1520-6750(199012)37:6<961::aid-nav3220370615>3.0.co;2-topenalex-snapshot
Convergence properties of the modified subgradient method of camerini et al
inferred← citeshttps://doi.org/10.1007/978-1-4020-6266-7_65openalex-snapshot
A Model for GSM Mobile Network Design
inferred← citeshttps://doi.org/10.1007/978-1-4613-9617-8_7openalex-snapshot
Pricing Criteria in Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-44914-2_34openalex-snapshot
Multiple Cuts in Separating Plane Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-69909-2_26openalex-snapshot
Can the Ellipsoid Method be Efficient?
inferred← citeshttps://doi.org/10.1007/978-90-481-3662-9_80openalex-snapshot
Scalability Analysis of a Model for GSM Mobile Network Design
inferred← citeshttps://doi.org/10.1007/bf00934744openalex-snapshot
On a space extension algorithm for nondifferentiable optimization
inferred← citeshttps://doi.org/10.1007/bf00935173openalex-snapshot
A minimization method for the sum of a convex function and a continuously differentiable function
inferred← citeshttps://doi.org/10.1007/bf00940519openalex-snapshot
Descent algorithm for a class of convex nondifferentiable functions
inferred← citeshttps://doi.org/10.1007/bf01071394openalex-snapshot
Cut-off method with space extension in convex programming problems
inferred← citeshttps://doi.org/10.1007/bf01071552openalex-snapshot
Note on minimization methods employing space stretching
inferred← citeshttps://doi.org/10.1007/bf01417939openalex-snapshot
Complexity and computability of solutions to linear programming systems
inferred← citeshttps://doi.org/10.1007/bf01581042openalex-snapshot
Convergence of a cyclic ellipsoid algorithm for systems of linear equalities
inferred← citeshttps://doi.org/10.1007/bf01582060openalex-snapshot
A deep cut ellipsoid algorithm for convex programming: Theory and applications
inferred← citeshttps://doi.org/10.1007/bf01583776openalex-snapshot
Modifications and implementation of the ellipsoid algorithm for linear programming
inferred← citeshttps://doi.org/10.1007/bf01584320openalex-snapshot
Optimization of lipschitz continuous functions
inferred← citeshttps://doi.org/10.1007/bf01585708openalex-snapshot
Complexity analysis of a linear complementarity algorithm based on a Lyapunov function
inferred← citeshttps://doi.org/10.1007/bf01585727openalex-snapshot
A “build-down” scheme for linear programming
inferred← citeshttps://doi.org/10.1007/bf01588795openalex-snapshot
An O(n 3 L) primal interior point algorithm for convex quadratic programming
inferred← citeshttps://doi.org/10.1007/bf01720281openalex-snapshot
The ellipsoid method and its implications
inferred← citeshttps://doi.org/10.1007/bf02192206openalex-snapshot
Stochastic penalty function methods for nonsmooth constrained minimization
inferred← citeshttps://doi.org/10.1007/bf02192640openalex-snapshot
General models in min-max continous location: Theory and solution techniques
inferred← citeshttps://doi.org/10.1007/bf02591882openalex-snapshot
Variable metric relaxation methods, part II: The ellipsoid method
inferred← citeshttps://doi.org/10.1007/bfb0035464openalex-snapshot
An approach to variable metric bundle methods
inferred← citeshttps://doi.org/10.1007/bfb0120703openalex-snapshot
A method of conjugate subgradients for minimizing nondifferentiable functions
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-0095-7openalex-snapshot
A simple polynomial-time rescaling algorithm for solving linear programs
inferred← citeshttps://doi.org/10.1007/s10559-025-00789-5openalex-snapshot
On the 95th Anniversary of the Birth of Volodymyr Serhiyovych Mykhalevych
inferred← citeshttps://doi.org/10.1007/s10559-025-00796-6openalex-snapshot
Scientific Legacy of Academician N. Z. Shor
inferred← citeshttps://doi.org/10.1007/s10589-005-3914-xopenalex-snapshot
Convergence and Computational Analyses for Some Variable Target Value and Subgradient Deflection Methods
inferred← citeshttps://doi.org/10.1007/s10589-007-9072-6openalex-snapshot
The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
inferred← citeshttps://doi.org/10.1016/0167-6377(86)90010-6openalex-snapshot
The symmetric rank-one quasi-Newton method is a space-dilation subgradient algorithm
inferred← citeshttps://doi.org/10.1016/0377-2217(92)90080-sopenalex-snapshot
Projection algorithms for linear programming
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-12-468662-5.50016-1openalex-snapshot
CONVERGENCE RESULTS IN A CLASS OF VARIABLE METRIC SUBGRADIENT METHODS11This research was supported in part by the D.G.E.S. (Quebec), the N.S.E.R.C. of Canada under grant A 4152, and the S.S.H.R.C. of Canada.
inferred← citeshttps://doi.org/10.1016/b978-0-444-89596-7.50023-7openalex-snapshot
Mathematical Programming and Convex Geometry
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50032-4openalex-snapshot
10.1016/b978-044488002-4/50032-4
inferred← citeshttps://doi.org/10.1016/j.automatica.2007.04.003openalex-snapshot
A probabilistic analytic center cutting plane method for feasibility of uncertain LMIs
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)01003-0openalex-snapshot
Chapter II Linear programming
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01008-xopenalex-snapshot
Chapter VII Nondifferentiable optimization
inferred← citeshttps://doi.org/10.1017/9781108699211openalex-snapshot
Algorithms for Convex Optimization
inferred← citeshttps://doi.org/10.1017/9781108699211.003openalex-snapshot
Bridging Continuous and Discrete Optimization
inferred← citeshttps://doi.org/10.1017/9781108699211.006openalex-snapshot
Convex Optimization and Efficiency
inferred← citeshttps://doi.org/10.1017/9781108699211.009openalex-snapshot
Mirror Descent and the MultiplicativeWeights Update
inferred← citeshttps://doi.org/10.1017/9781108699211.010openalex-snapshot
Accelerated Gradient Descent
inferred← citeshttps://doi.org/10.1017/9781108699211.012openalex-snapshot
An Interior Point Method for Linear Programming
inferred← citeshttps://doi.org/10.1017/9781108699211.013openalex-snapshot
Variants of Interior Point Method and Self-Concordance
inferred← citeshttps://doi.org/10.1017/9781108699211.014openalex-snapshot
Ellipsoid Method for Linear Programming
inferred← citeshttps://doi.org/10.1017/9781108699211.015openalex-snapshot
Ellipsoid Method for Convex Optimization
inferred← citeshttps://doi.org/10.1023/a:1011272319638openalex-snapshot
Limited Memory Space Dilation and Reduction Algorithms
inferred← citeshttps://doi.org/10.1023/b:casa.0000003503.25710.84openalex-snapshot
Algorithms of Nondifferentiable Optimization: Development and Application
inferred← citeshttps://doi.org/10.1057/jors.2009.164openalex-snapshot
Optimal supplier choice with discounting
inferred← citeshttps://doi.org/10.1080/02331934.2024.2322152openalex-snapshot
A descent subgradient method using Mifflin's line search for nonsmooth nonconvex optimization
inferred← citeshttps://doi.org/10.1080/02331938608843138openalex-snapshot
An objective-function ellipsoid-algorithm for convex quadraical programming
inferred← citeshttps://doi.org/10.1080/10556789808805693openalex-snapshot
The analyticity of interior-point-paths at strictly complementary solutions of linear programs
inferred← citeshttps://doi.org/10.1109/21.97474openalex-snapshot
A decision support system for the design of a large electronics test facility
inferred← citeshttps://doi.org/10.1109/cdc.2006.377664openalex-snapshot
An Iterative Localization Method for Probabilistic Feasibility of Uncertain LMIs
inferred← citeshttps://doi.org/10.1109/cim.1988.5415openalex-snapshot
Parallel machine scheduling using Lagrangian relaxation
inferred← citeshttps://doi.org/10.1109/lics.2013.23openalex-snapshot
Maximum Matching and Linear Programming in Fixed-Point Logic with Counting
inferred← citeshttps://doi.org/10.1109/sfcs.1982.44openalex-snapshot
The ellipsoid algorithm for linear inequalities in exact arithmetic
inferred← citeshttps://doi.org/10.1109/sfcs.1982.94openalex-snapshot
The ellipsoid algorithm for linear inequalities in exact arithmetic
inferred← citeshttps://doi.org/10.1111/j.1467-9574.1981.tb00717.xopenalex-snapshot
The complexity of linear programming
inferred← citeshttps://doi.org/10.1137/1034048openalex-snapshot
Path-Following Methods for Linear Programming
inferred← citeshttps://doi.org/10.1137/s1052623493254273openalex-snapshot
Solving LP Problems via Weighted Centers
inferred← citeshttps://doi.org/10.1145/1007352.1007404openalex-snapshot
A simple polynomial-time rescaling algorithm for solving linear programs
inferred← citeshttps://doi.org/10.1145/2822890openalex-snapshot
Solving Linear Programs without Breaking Abstractions
inferred← citeshttps://doi.org/10.1287/ijoc.1050.0158openalex-snapshot
Enhancing Lagrangian Dual Optimization for Linear Programs by Obviating Nondifferentiability
inferred← citeshttps://doi.org/10.1287/moor.1050.0164openalex-snapshot
Boundedness Theorems for the Relaxation Method
inferred← citeshttps://doi.org/10.1287/moor.7.2.245openalex-snapshot
Dimensional Reduction Variant of the Ellipsoid Algorithm for Linear Programming Problems
inferred← citeshttps://doi.org/10.1287/moor.8.1.135openalex-snapshot
Convergence Rates of the Ellipsoid Method on General Convex Functions
inferred← citeshttps://doi.org/10.1287/opre.29.6.1039openalex-snapshot
Feature Article—The Ellipsoid Method: A Survey
inferred← citeshttps://doi.org/10.13097/archive-ouverte/unige:159openalex-snapshot
The homogeneous analytic center cutting plane method
inferred← citeshttps://doi.org/10.1609/aaai.v35i5.16499openalex-snapshot
Smooth Convex Optimization Using Sub-Zeroth-Order Oracles
inferred← citeshttps://doi.org/10.2298/bg20120517gardasevicopenalex-snapshot
Numericke metode za resavanje konveksnih nediferencijabilnih optimizacionih problema
inferred← citeshttps://doi.org/10.34229/2707-451x.24.1.3openalex-snapshot
Using the Ellipsoid Method for Sylvester's Problem and its Generalization
inferred← citeshttps://doi.org/10.48550/arxiv.0909.1045openalex-snapshot
A Novel Model for Optimized GSM Network Design
inferred← citeshttps://doi.org/10.5821/dissertation-2117-93827openalex-snapshot
Applicability of deterministic global optimization to the short-term hydrothermal coordination 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.