On the public citation graph

Finite convergence of algorithms for nonlinear programs and variational inequalities

https://doi.org/10.1007/bf00940629
0 signed · 67 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-0-387-74503-9openalex-snapshot
Linear and Nonlinear Programming
inferredcites →https://doi.org/10.1007/978-3-642-48294-6openalex-snapshot
Foundations of Optimization
inferredcites →https://doi.org/10.1007/bf00938597openalex-snapshot
Sensitivity analysis for variational inequalities
inferredcites →https://doi.org/10.1007/bf00939081openalex-snapshot
On the convergence of projected gradient processes to singular critical points
inferredcites →https://doi.org/10.1007/bf01268170openalex-snapshot
Solution of symmetric linear complementarity problems by iterative methods
inferredcites →https://doi.org/10.1007/bf01581071openalex-snapshot
Minimum principle sufficiency
inferredcites →https://doi.org/10.1007/bf01585112openalex-snapshot
Iterative methods for variational and complementarity problems
inferredcites →https://doi.org/10.1007/bf02591891openalex-snapshot
An iterative scheme for variational inequalities
inferredcites →https://doi.org/10.1007/bf02592073openalex-snapshot
Projected gradient methods for linearly constrained problems
inferredcites →https://doi.org/10.1007/bfb0120989openalex-snapshot
Generalized equations and their solutions, part II: Applications to nonlinear programming
inferredcites →https://doi.org/10.1016/0022-247x(91)90259-3openalex-snapshot
Note on solving linear complementarity problems as jointly constrained bilinear programs
inferredcites →https://doi.org/10.1016/0041-5553(66)90114-5openalex-snapshot
Constrained minimization methods
inferredcites →https://doi.org/10.1016/0167-6377(88)90047-8openalex-snapshot
A simple characterization of solution sets of convex programs
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(85)90076-1openalex-snapshot
Nonlinear programming: Theory, algorithms, and applications
inferredcites →https://doi.org/10.1016/0378-4754(86)90092-3openalex-snapshot
Linear and nonlinear programming.
inferredcites →https://doi.org/10.1057/jors.1979.231openalex-snapshot
Nonlinear Programming -- Theory and Algorithms
inferredcites →https://doi.org/10.1090/s0002-9904-1964-11178-2openalex-snapshot
Convex programming in Hilbert space
inferredcites →https://doi.org/10.1109/tac.1976.1101194openalex-snapshot
On the Goldstein-Levitin-Polyak gradient projection method
inferredcites →https://doi.org/10.1137/0317015openalex-snapshot
Rates of Convergence for Conditional Gradient Algorithms Near Singular and Nonsingular Extremals
inferredcites →https://doi.org/10.1137/0318035openalex-snapshot
Convergence Rates for Conditional Gradient Sequences Generated by Implicit Step Length Rules
inferredcites →https://doi.org/10.1137/0318050openalex-snapshot
Newton’s Method and the Goldstein Step-Length Rule for Constrained Minimization Problems
inferredcites →https://doi.org/10.1137/0319022openalex-snapshot
Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes
inferredcites →https://doi.org/10.1137/0320018openalex-snapshot
Projected Newton Methods for Optimization Problems with Simple Constraints
inferredcites →https://doi.org/10.1137/0322061openalex-snapshot
Two-Metric Projection Methods for Constrained Optimization
inferredcites →https://doi.org/10.1137/0327002openalex-snapshot
Convergence of SQP-Like Methods for Constrained Optimization
inferredcites →https://doi.org/10.1137/0725068openalex-snapshot
On the Identification of Active Constraints
inferredcites →https://doi.org/10.1287/moor.8.2.273openalex-snapshot
Jointly Constrained Biconvex Programming
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis

What points at this work

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

inferred← citeshttps://doi.org/10.1007/bf00940785openalex-snapshot
First-order conditions for isolated locally optimal solutions
inferred← citeshttps://doi.org/10.1007/bf01581071openalex-snapshot
Minimum principle sufficiency
inferred← citeshttps://doi.org/10.1007/s10107-013-0730-4openalex-snapshot
Optimality, identifiability, and sensitivity
inferred← citeshttps://doi.org/10.1007/s10208-021-09516-wopenalex-snapshot
Proximal Methods Avoid Active Strict Saddles of Weakly Convex Functions
inferred← citeshttps://doi.org/10.1007/s10589-007-9139-4openalex-snapshot
A proximal method for identifying active manifolds
inferred← citeshttps://doi.org/10.1007/s10898-006-9091-3openalex-snapshot
Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
inferred← citeshttps://doi.org/10.1007/s10898-025-01550-0openalex-snapshot
POINT-BASED SUFFICIENT CONDITIONS FOR SHARP SOLUTIONS IN NONSMOOTH OPTIMIZATION
inferred← citeshttps://doi.org/10.1007/s11228-016-0360-0openalex-snapshot
Variational Analysis on Local Sharp Minima via Exact Penalization
inferred← citeshttps://doi.org/10.1007/s11228-016-0394-3openalex-snapshot
Computing Proximal Points of Convex Functions with Inexact Subgradients
inferred← citeshttps://doi.org/10.1016/0022-247x(91)90259-3openalex-snapshot
Note on solving linear complementarity problems as jointly constrained bilinear programs
inferred← citeshttps://doi.org/10.1016/j.aml.2024.109104openalex-snapshot
Finite termination of the optimal solution sequence in parametric optimization
inferred← citeshttps://doi.org/10.1016/j.jmaa.2005.03.026openalex-snapshot
On finite convergence of proximal point algorithms for variational inequalities
inferred← citeshttps://doi.org/10.1016/s0252-9602(17)30293-xopenalex-snapshot
GLOBAL WEAK SHARP MINIMA AND COMPLETENESS OF METRIC SPACE
inferred← citeshttps://doi.org/10.1023/a:1008241411395openalex-snapshot
A Finite Algorithm for Global Minimization of Separable Concave Programs
inferred← citeshttps://doi.org/10.1023/a:1026506516738openalex-snapshot
Some Methods Based on the D-Gap Function for Solving Monotone Variational Inequalities
inferred← citeshttps://doi.org/10.1080/02331930600815884openalex-snapshot
Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems
inferred← citeshttps://doi.org/10.1080/02331934.2024.2322155openalex-snapshot
On the weakest constraint qualification for sharp local minimizers
inferred← citeshttps://doi.org/10.1080/10556788.2011.579965openalex-snapshot
Global convergence and finite termination of a class of smooth penalty function algorithms
inferred← citeshttps://doi.org/10.1080/10556788.2011.638923openalex-snapshot
Derivative-free optimization methods for finite minimax problems
inferred← citeshttps://doi.org/10.1088/1361-6420/aba417openalex-snapshot
Relax-and-split method for nonconvex inverse problems
inferred← citeshttps://doi.org/10.1137/0331063openalex-snapshot
Weak Sharp Minima in Mathematical Programming
inferred← citeshttps://doi.org/10.1137/130916710openalex-snapshot
Orthogonal Invariance and Identifiability
inferred← citeshttps://doi.org/10.1137/15m1020770openalex-snapshot
Generic Minimizing Behavior in Semialgebraic Optimization
inferred← citeshttps://doi.org/10.1137/19m1237909openalex-snapshot
Partial Smoothness and Constant Rank
inferred← citeshttps://doi.org/10.1137/22m1510467openalex-snapshot
Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming
inferred← citeshttps://doi.org/10.1137/s0363012901389469openalex-snapshot
Global Weak Sharp Minima on Banach Spaces
inferred← citeshttps://doi.org/10.1137/s0363012994261690openalex-snapshot
Nondegenerate Solutions and Related Concepts in Affine Variational Inequalities
inferred← citeshttps://doi.org/10.1137/s1052623496309867openalex-snapshot
Weak Sharp Solutions of Variational Inequalities
inferred← citeshttps://doi.org/10.1137/s105262349935178xopenalex-snapshot
On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems
inferred← citeshttps://doi.org/10.1137/s1052623499360616openalex-snapshot
Erratum: Weak Sharp Solutions of Variational Inequalities
inferred← citeshttps://doi.org/10.1201/b11156-14openalex-snapshot
Representation of the Feasible Set and KKT Conditions
inferred← citeshttps://doi.org/10.1287/moor.2020.1075openalex-snapshot
Active‐Set Newton Methods and Partial Smoothness
inferred← citeshttps://doi.org/10.3390/mca22020036openalex-snapshot
Finite Convergence for Feasible Solution Sequence of Variational Inequality Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1207.6628openalex-snapshot
Optimality, identifiability, and sensitivity
inferred← citeshttps://doi.org/10.48550/arxiv.1304.1198openalex-snapshot
Orthogonal Invariance and Identifiability
inferred← citeshttps://doi.org/10.48550/arxiv.1504.07694openalex-snapshot
Generic minimizing behavior in semi-algebraic optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1611.00724openalex-snapshot
Computing proximal points of convex functions with inexact subgradients
inferred← citeshttps://doi.org/10.48550/arxiv.1802.02654openalex-snapshot
Relax-and-split method for nonsmooth nonconvex 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.