On the public citation graph

Modified proximal point algorithm for extended linear-quadratic programming

https://doi.org/10.1007/bf00253806
0 signed · 30 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/978-3-642-61370-8_15openalex-snapshot
An Implementation of the Lagrangian Finite-Generation Method
inferredcites →https://doi.org/10.1007/bf01582268openalex-snapshot
Computational schemes for large-scale problems in extended linear-quadratic programming
inferredcites →https://doi.org/10.1007/bfb0007130openalex-snapshot
Linear-quadratic programming problems with stochastic penalties: The finite generation algorithm
inferredcites →https://doi.org/10.1007/bfb0120929openalex-snapshot
Some continuity properties of polyhedral multifunctions
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/0167-6377(91)90087-6openalex-snapshot
Characterization of solution sets of convex programs
inferredcites →https://doi.org/10.1090/pspum/018.1/0285942openalex-snapshot
Monotone operators associated with saddle-functions and minimax problems
inferredcites →https://doi.org/10.1137/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
inferredcites →https://doi.org/10.1137/0322019openalex-snapshot
Asymptotic Convergence Analysis of the Proximal Point Algorithm
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.1137/0803039openalex-snapshot
Primal-Dual Projected Gradient Algorithms for Extended Linear-Quadratic Programming
inferredcites →https://doi.org/10.1137/1019005openalex-snapshot
Quasi-Newton Methods, Motivation and Theory
inferredcites →https://doi.org/10.1137/1021091openalex-snapshot
Least Change Secant Updates for Quasi-Newton Methods
inferredcites →https://doi.org/10.1215/s0012-7094-62-02933-2openalex-snapshot
Monotone (nonlinear) operators in Hilbert space
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis
inferredcites →https://doi.org/10.24033/bsmf.1625openalex-snapshot
Proximité et dualité dans un espace hilbertien

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-1-4615-2025-2_6openalex-snapshot
Complementarity Problems
inferred← citeshttps://doi.org/10.1007/978-1-4899-1358-6_11openalex-snapshot
A Primal-Dual Proximal Point Algorithm for Variational Inequality Problems
inferred← citeshttps://doi.org/10.1007/978-3-662-12646-2_1openalex-snapshot
Basic Issues in Lagrangian Optimization
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.1023/a:1022630801549openalex-snapshot
Convergence Analysis of Some Methods for Minimizing a Nonsmooth Convex Function
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.1137/0803039openalex-snapshot
Primal-Dual Projected Gradient Algorithms for Extended Linear-Quadratic Programming
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.1155/s1025583498000101openalex-snapshot
A new method for nonsmooth convex optimization
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.15807/jorsj.37.297openalex-snapshot
PRIMAL-DUAL PROXIMAL POINT ALGORITHM FOR MULTICOMMODITY NETWORK FLOW PROBLEMS
inferred← citeshttps://doi.org/10.15807/jorsj.39.213openalex-snapshot
PARTIAL PROXIMAL METHOD OF MULTIPLIERS FOR CONVEX PROGRAMMING 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.