On the public citation graph
Computational schemes for large-scale problems in extended linear-quadratic 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.1007/978-3-642-61370-8_15openalex-snapshot
An Implementation of the Lagrangian Finite-Generation Method
inferredcites →https://doi.org/10.1007/978-3-642-74306-1_3openalex-snapshot
Decomposition Schemes for Finding Saddle Points of Quasi-Convex-Concave Functions
inferredcites →https://doi.org/10.1007/bf01588795openalex-snapshot
An O(n 3 L) primal interior point algorithm for convex quadratic programming
inferredcites →https://doi.org/10.1007/bfb0074500openalex-snapshot
Methods of Descent for Nondifferentiable Optimization
inferredcites →https://doi.org/10.1007/bfb0121126openalex-snapshot
A Lagrangian finite generation technique for solving linear-quadratic problems in stochastic programming
inferredcites →https://doi.org/10.1016/0098-1354(83)80004-0openalex-snapshot
Methods for quadratic programming: A survey
inferredcites →https://doi.org/10.1137/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
inferredcites →https://doi.org/10.1137/0325023openalex-snapshot
Iterative Methods for Large Convex Quadratic Programs: A Survey
inferredcites →https://doi.org/10.1137/0325045openalex-snapshot
Linear-Quadratic Programming and Optimal Control
inferredcites →https://doi.org/10.1137/0328046openalex-snapshot
Generalized Linear-Quadratic Problems of Deterministic and Stochastic Optimal Control in Discrete Time
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.2969/jmsj/03010023openalex-snapshot
Variational inequalities and complementarity problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/asm.3150080309openalex-snapshot
Linear‐quadratic efficient frontiers for portfolio optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-3557-3_3openalex-snapshot
An Iterative Method for the Minimax Problem
inferred← citeshttps://doi.org/10.1007/978-1-4757-3226-9_20openalex-snapshot
Extended Nonlinear Programming
inferred← citeshttps://doi.org/10.1007/978-1-4757-6019-4_22openalex-snapshot
Perturbation of Generalized Kuhn-Tucker Points in Finite-Dimensional Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-04247-3_2openalex-snapshot
Equations and Unconstrained Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-04247-3_3openalex-snapshot
Variational Problems: Local Methods
inferred← citeshttps://doi.org/10.1007/978-3-642-79459-9_1openalex-snapshot
On the Degree of Decentralization in Large-Scale Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-662-12646-2_1openalex-snapshot
Basic Issues in Lagrangian Optimization
inferred← citeshttps://doi.org/10.1007/978-90-481-9577-0_9openalex-snapshot
Duality for Entropy Optimization and its Applications
inferred← citeshttps://doi.org/10.1007/bf00253806openalex-snapshot
Modified proximal point algorithm for extended linear-quadratic programming
inferred← citeshttps://doi.org/10.1007/bf01581275openalex-snapshot
A nonsmooth version of Newton's method
inferred← citeshttps://doi.org/10.1007/bf01582211openalex-snapshot
An infeasible-interior-point algorithm for linear complementarity problems
inferred← citeshttps://doi.org/10.1007/bf01582212openalex-snapshot
Solving large-scale minimax problems with the primal—dual steepest descent algorithm
inferred← citeshttps://doi.org/10.1007/bf01582577openalex-snapshot
Superlinearly convergent approximate Newton methods for LC1 optimization problems
inferred← citeshttps://doi.org/10.1007/bf02031711openalex-snapshot
An SQP algorithm for extended linear-quadratic problems in stochastic programming
inferred← citeshttps://doi.org/10.1007/bf02189800openalex-snapshot
Globally and superlinearly convergent trust-region algorithm for convex SC1-minimization problems and its application to stochastic programs
inferred← citeshttps://doi.org/10.1007/bf02192198openalex-snapshot
Sensitivity analysis for generalized linear-quadratic problems
inferred← citeshttps://doi.org/10.1007/bf02614396openalex-snapshot
Solution of monotone complementarity problems with locally Lipschitzian functions
inferred← citeshttps://doi.org/10.1007/pl00011431openalex-snapshot
On reduced convex QP formulations of monotone LCPs
inferred← citeshttps://doi.org/10.1007/s10107-012-0586-zopenalex-snapshot
A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems
inferred← citeshttps://doi.org/10.1007/s10483-012-1548-6openalex-snapshot
New exact penalty function for solving constrained finite min-max problems
inferred← citeshttps://doi.org/10.1007/s10589-014-9658-8openalex-snapshot
Local convergence of the method of multipliers for variational and optimization problems under the noncriticality assumption
inferred← citeshttps://doi.org/10.1007/s11228-012-0218-zopenalex-snapshot
The Josephy–Newton Method for Semismooth Generalized Equations and Semismooth SQP for Optimization
inferred← citeshttps://doi.org/10.1007/s11766-001-0039-6openalex-snapshot
A globally and superlinearly convergent trust region method for LC 1 optimization problems
inferred← citeshttps://doi.org/10.1016/0167-6377(94)00059-fopenalex-snapshot
Minimization of SC1 functions and the Maratos effect
inferred← citeshttps://doi.org/10.1016/0305-0548(95)00076-3openalex-snapshot
A predictor-corrector method for extended linear-quadratic programming
inferred← citeshttps://doi.org/10.1016/0377-0427(94)00082-copenalex-snapshot
Newton's method for quadratic stochastic programs with recourse
inferred← citeshttps://doi.org/10.1016/0377-0427(94)90377-8openalex-snapshot
The approximation of separable stochastic programs
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.cam.2020.112741openalex-snapshot
A smoothing iterative method for the finite minimax problem
inferred← citeshttps://doi.org/10.1016/j.ijpe.2009.11.003openalex-snapshot
A multistage stochastic programming model for the New Zealand dairy industry
inferred← citeshttps://doi.org/10.1016/j.neucom.2008.02.016openalex-snapshot
Applications of the general projection neural network in solving extended linear-quadratic programming problems with linear constraints
inferred← citeshttps://doi.org/10.1016/s0096-3003(97)10053-4openalex-snapshot
Newton's method and quasi-Newton—SQP method for general LC1 constrained optimization
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00178-1openalex-snapshot
Newton's method for linear inequality systems
inferred← citeshttps://doi.org/10.1017/s0334270000008857openalex-snapshot
On the convergence of an iterative method for the minimax problem
inferred← citeshttps://doi.org/10.1023/a:1011211101714openalex-snapshot
Smoothing Method for Minimax Problems
inferred← citeshttps://doi.org/10.1080/02331930412331332052openalex-snapshot
Convex optimization problems with arbitrary right-hand side perturbations
inferred← citeshttps://doi.org/10.1080/02331930701762829openalex-snapshot
A subgradient-type method for the equilibrium problem over the fixed point set and its applications
inferred← citeshttps://doi.org/10.1080/02331939708844364openalex-snapshot
The iterative methods for monotone generalized variational inequalities
inferred← citeshttps://doi.org/10.1080/10556788.2011.557727openalex-snapshot
Semismooth SQP method for equality-constrained optimization problems with an application to the lifted reformulation of mathematical programs with complementarity constraints
inferred← citeshttps://doi.org/10.1080/10556789508805619openalex-snapshot
Mcplib: a collection of nonlinear mixed complementarity problems
inferred← citeshttps://doi.org/10.1109/tip.2011.2159983openalex-snapshot
A Primal–Dual Method for Total-Variation-Based Wavelet Domain Inpainting
inferred← citeshttps://doi.org/10.1134/s0965542512120081openalex-snapshot
Multiplier methods for optimization problems with Lipschitzian derivatives
inferred← citeshttps://doi.org/10.1137/0801006openalex-snapshot
Minimization of Locally Lipschitzian Functions
inferred← citeshttps://doi.org/10.1137/0803021openalex-snapshot
Nonsmooth Equations: Motivation and Algorithms
inferred← citeshttps://doi.org/10.1137/0803039openalex-snapshot
Primal-Dual Projected Gradient Algorithms for Extended Linear-Quadratic Programming
inferred← citeshttps://doi.org/10.1137/0804027openalex-snapshot
On Smoothing Exact Penalty Functions for Convex Constrained Optimization
inferred← citeshttps://doi.org/10.1137/0805006openalex-snapshot
On the Primal-Dual Steepest Descent Algorithm for Extended Linear-Quadratic Programming
inferred← citeshttps://doi.org/10.1137/s0036144595285963openalex-snapshot
Engineering and Economic Applications of Complementarity Problems
inferred← citeshttps://doi.org/10.1137/s0363012993252711openalex-snapshot
On a Certain Parameter of the Discretized Extended Linear-Quadratic Problem of Optimal Control
inferred← citeshttps://doi.org/10.1137/s0363012994276111openalex-snapshot
A Predictor-Corrector Algorithm for a Class of Nonlinear Saddle Point Problems
inferred← citeshttps://doi.org/10.1137/s1052623493258556openalex-snapshot
A New Finite Continuation Algorithm for Linear Programming
inferred← citeshttps://doi.org/10.1137/s1052623495279797openalex-snapshot
Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
inferred← citeshttps://doi.org/10.1137/s1052623497330823openalex-snapshot
A General Primal-Dual Envelope Method for Convex Programming Problems
inferred← citeshttps://doi.org/10.1155/2020/9108150openalex-snapshot
An Active Set Smoothing Method for Solving Unconstrained Minimax Problems
inferred← citeshttps://doi.org/10.11606/t.45.2024.tde-17062025-132549openalex-snapshot
First-order regularized algorithms with complexity properties for order-valued and low-order-valued optimization problems
inferred← citeshttps://doi.org/10.1287/moor.21.4.815openalex-snapshot
A Superlinear Infeasible-Interior-Point Algorithm for Monotone Complementarity Problems
inferred← citeshttps://doi.org/10.1287/opre.1080.0659openalex-snapshot
Decomposition Based Interior Point Methods for Two-Stage Stochastic Convex Quadratic Programs with Recourse
inferred← citeshttps://doi.org/10.2298/fil2103737hopenalex-snapshot
A new three-term conjugate gradient method for solving the finite minimax problems
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.