On the public citation graph
Partial linearization methods in nonlinear programming
0 signed · 74 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/nav.3800030109openalex-snapshot
An algorithm for quadratic programming
inferredcites →https://doi.org/10.1007/978-3-642-82118-9openalex-snapshot
Minimization Methods for Non-Differentiable Functions
inferredcites →https://doi.org/10.1007/bf00935173openalex-snapshot
A minimization method for the sum of a convex function and a continuously differentiable function
inferredcites →https://doi.org/10.1007/bf00940570openalex-snapshot
A method for minimizing the sum of a convex function and a continuously differentiable function
inferredcites →https://doi.org/10.1007/bf01582565openalex-snapshot
A class of gap functions for variational inequalities
inferredcites →https://doi.org/10.1007/bf01585696openalex-snapshot
Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
inferredcites →https://doi.org/10.1007/bf01588789openalex-snapshot
A successive quadratic programming method for a class of constrained nonsmooth optimization problems
inferredcites →https://doi.org/10.1016/0016-0032(53)90617-6openalex-snapshot
Principles of mathematical analysis
inferredcites →https://doi.org/10.1016/0305-0548(93)90042-hopenalex-snapshot
Nonlinear programming: theory and algorithms
inferredcites →https://doi.org/10.1016/0377-2217(84)90131-0openalex-snapshot
Cross decomposition applied to the stochastic transportation problem
inferredcites →https://doi.org/10.1016/0377-2217(93)90046-popenalex-snapshot
A unified description of iterative algorithms for traffic equilibria
inferredcites →https://doi.org/10.1057/jors.1977.183openalex-snapshot
Non-Linear Programming—Theory and Methods
inferredcites →https://doi.org/10.1057/jors.1979.231openalex-snapshot
Nonlinear Programming -- Theory and Algorithms
inferredcites →https://doi.org/10.1080/00207728108963798openalex-snapshot
A generalized proximal point algorithm for certain non-convex minimization problems
inferredcites →https://doi.org/10.1080/02331939008843577openalex-snapshot
An algorithm for nonlinear programs over Cartesian product sets
inferredcites →https://doi.org/10.1080/02331939308843903openalex-snapshot
A partial linearization method for the traffic assignment problem
inferredcites →https://doi.org/10.1090/s0002-9947-1975-0367131-6openalex-snapshot
Generalized Gradients and Applications
inferredcites →https://doi.org/10.1137/0306032openalex-snapshot
A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
inferredcites →https://doi.org/10.1287/moor.1.2.97openalex-snapshot
Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
inferredcites →https://doi.org/10.1287/trsc.8.4.321openalex-snapshot
A Method for Computing Network Equilibrium with Elastic Demands
inferredcites →https://doi.org/10.2140/pjm.1966.16.1openalex-snapshot
Minimization of functions having Lipschitz continuous first partial derivatives
inferredcites →https://doi.org/10.2174/9789811459597120010004openalex-snapshot
Introduction to Optimization
inferredcites →https://doi.org/10.2307/3008856openalex-snapshot
Non-Linear Programming -- Theory and Methods
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_77openalex-snapshot
Cost Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_101openalex-snapshot
Cost Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4613-3400-2_9openalex-snapshot
Parallel Cost Approximation Algorithms for Differentiable Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_101-1openalex-snapshot
Cost Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-46454-1_51openalex-snapshot
Partial Linearization Based Optimization for Multi-class SVM
inferred← citeshttps://doi.org/10.1007/bf01582565openalex-snapshot
A class of gap functions for variational inequalities
inferred← citeshttps://doi.org/10.1007/bf02564711openalex-snapshot
Extensions of Dinkelbach's algorithm for solving non-linear fractional programming problems
inferred← citeshttps://doi.org/10.1007/s00773-018-0562-2openalex-snapshot
A new method for parametric design of hull surface based on energy optimization
inferred← citeshttps://doi.org/10.1007/s10479-006-0007-xopenalex-snapshot
Approximation of the steepest descent direction for the O-D matrix adjustment problem
inferred← citeshttps://doi.org/10.1007/s10479-010-0772-4openalex-snapshot
Large scale stochastic inventory routing problems with split delivery and service level constraints
inferred← citeshttps://doi.org/10.1007/s11067-014-9279-xopenalex-snapshot
Combined Gravity Model Trip Distribution and Paired Combinatorial Logit Stochastic User Equilibrium Problem
inferred← citeshttps://doi.org/10.1016/0191-2615(95)00026-7openalex-snapshot
An algorithm for the stochastic user equilibrium problem
inferred← citeshttps://doi.org/10.1016/0377-2217(93)90046-popenalex-snapshot
A unified description of iterative algorithms for traffic equilibria
inferred← citeshttps://doi.org/10.1016/j.apm.2015.01.010openalex-snapshot
A modified truncated Newton algorithm for the logit-based stochastic user equilibrium problem
inferred← citeshttps://doi.org/10.1016/j.dsp.2008.02.003openalex-snapshot
Impulse-doublet sampling of random waveforms
inferred← citeshttps://doi.org/10.1016/j.ejor.2003.08.004openalex-snapshot
Adjustment of O–D trip matrices from observed volumes: An algorithmic approach based on conjugate directions
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.02.058openalex-snapshot
New algorithmic alternatives for the O–D matrix adjustment problem on traffic networks
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.11.009openalex-snapshot
A heuristic for the OD matrix adjustment problem in a congested transport network
inferred← citeshttps://doi.org/10.1016/j.ejor.2026.03.018openalex-snapshot
Equilibrium analysis for emerging mobility services with loyalty bundle schemes
inferred← citeshttps://doi.org/10.1016/j.jmse.2020.05.003openalex-snapshot
A mixed behaviour equilibrium model with mode choice and its application to the endogenous demand of automated vehicles
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/j.trb.2019.02.002openalex-snapshot
Prism-based path set restriction for solving Markovian traffic assignment problem
inferred← citeshttps://doi.org/10.1016/j.trb.2021.10.013openalex-snapshot
Markovian traffic equilibrium assignment based on network generalized extreme value model
inferred← citeshttps://doi.org/10.1016/j.trc.2017.06.018openalex-snapshot
A day-to-day route flow evolution process towards the mixed equilibria
inferred← citeshttps://doi.org/10.1023/a:1018358602892openalex-snapshot
Decomposition Methods for Differentiable Optimization Problems over Cartesian Product Sets
inferred← citeshttps://doi.org/10.1023/a:1018970905404openalex-snapshot
The combined distribution andstochastic assignment problem
inferred← citeshttps://doi.org/10.1080/0233193031000079856openalex-snapshot
Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis
inferred← citeshttps://doi.org/10.1080/02331939308843903openalex-snapshot
A partial linearization method for the traffic assignment problem
inferred← citeshttps://doi.org/10.1080/02331939708844324openalex-snapshot
Merit functions and descent algorithms for a class of variational ineqality problems
inferred← citeshttps://doi.org/10.1080/02331939808844409openalex-snapshot
Cost approximation algorithms with nonmonotone line searches for a general class of nonlinear programs
inferred← citeshttps://doi.org/10.1109/icsssm.2006.320640openalex-snapshot
A Model and Algorithm for Large Scale Stochastic Inventory Routing Problem
inferred← citeshttps://doi.org/10.1109/icsssm.2006.320648openalex-snapshot
A Lagrangian Relaxation Approach for Production Planning With Demand Uncertainty
inferred← citeshttps://doi.org/10.1109/mits.2023.3247509openalex-snapshot
A Systematic Approach for the Calibration of Route Choice Models Based on Stochastic User Equilibrium
inferred← citeshttps://doi.org/10.1109/spawc.2014.6941749openalex-snapshot
Joint optimization of radio and computational resources for multicell mobile cloud computing
inferred← citeshttps://doi.org/10.1109/tsipn.2015.2448520openalex-snapshot
Joint Optimization of Radio and Computational Resources for Multicell Mobile-Edge Computing
inferred← citeshttps://doi.org/10.1137/15m101628xopenalex-snapshot
Scalable Robust Matrix Recovery: Frank--Wolfe Meets Proximal Methods
inferred← citeshttps://doi.org/10.1137/s105262349427577xopenalex-snapshot
Cost Approximation: A Unified Framework of Descent Algorithms for Nonlinear Programs
inferred← citeshttps://doi.org/10.1155/2019/7313808openalex-snapshot
Improving Truncated Newton Method for the Logit‐Based Stochastic User Equilibrium Problem
inferred← citeshttps://doi.org/10.1287/mnsc.2021.4172openalex-snapshot
Mass Customization and the “Parts-Procurement Planning Problem”
inferred← citeshttps://doi.org/10.1287/trsc.31.4.349openalex-snapshot
Decomposition of Path Choice Entropy in General Transport Networks
inferred← citeshttps://doi.org/10.1287/trsc.35.4.389.10435openalex-snapshot
An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues
inferred← citeshttps://doi.org/10.2208/journalip.13.279openalex-snapshot
Efficient Algorithms for Solving Nested LOGIT type Combined Residential-Location and Transportation Network Equilibrium Models
inferred← citeshttps://doi.org/10.2208/jscejipm.70.i_611openalex-snapshot
STOCHASTIC USER EQUILIBRIUM TRAFFIC ASSIGNMENT WITH A NETWORK GEV BASED ROUTE CHOICE MODEL
inferred← citeshttps://doi.org/10.3390/math12243923openalex-snapshot
A Bi-Level Optimization Approach to Network Flow Management Incorporating Travelers’ Herd Effect
inferred← citeshttps://doi.org/10.3390/su172411144openalex-snapshot
A Comparative Analysis of the Effect of Route Set Size in Logit and Weibit-Based Stochastic Traffic Assignment
inferred← citeshttps://doi.org/10.3929/ethz-a-007050453openalex-snapshot
Sparse Convex Optimization Methods for Machine Learning
inferred← citeshttps://doi.org/10.48550/arxiv.1108.1170openalex-snapshot
Convex Optimization without Projection Steps
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.