pith. sign in

arxiv: 2604.20988 · v1 · submitted 2026-04-22 · 🧮 math.OC

Optimization Workshop Notes for Mathematical Programming with Equilibrium Constraints (MPECs): Verification of MPEC Hypotheses

Jiguang Yu This is my paper

Pith reviewed 2026-05-09 23:43 UTC · model grok-4.3

classification 🧮 math.OC MSC 90C3349J40
keywords MPECsfirst-order optimality conditionsvariational inequalitiescomplementarity systemsmathematical programminghypothesis verificationnonlinear programming
0
0 comments X

The pith

Workshop notes establish the hypotheses needed for valid first-order optimality conditions in MPECs and provide a practical verification guide.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper delivers a compact introduction to nonlinear programming, variational inequalities, and complementarity systems. It explains the mathematical logic behind the hypotheses that validate first-order optimality conditions for mathematical programs with equilibrium constraints. In addition, it shows researchers how to classify their models, select the right verification approach, prove the necessary hypotheses, and conduct accurate first-order analysis.

Core claim

By mastering the hypotheses from MPEC theory, including those drawn from variational inequalities and complementarity systems, one can classify optimization models and verify conditions to ensure that first-order optimality conditions apply correctly.

What carries the argument

The classification of MPEC models together with verification routes for hypotheses drawn from variational inequality and complementarity theory.

If this is right

  • Correct classification of a model determines which optimality theory applies.
  • Proving the appropriate hypotheses produces valid first-order stationarity conditions.
  • Researchers obtain reliable first-order analysis without misapplication of the underlying theory.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The notes could reduce common errors when researchers move from MPEC theory to concrete models in economics or engineering.
  • A natural extension is to add worked examples that walk through the full classification-to-proof pipeline for a representative application.
  • The same verification logic might transfer to related equilibrium problems outside the MPEC setting.

Load-bearing premise

The standard theory of MPECs and variational inequalities is sufficient and accurate for the verification routes described, and readers possess the background to apply the classification and proof steps correctly.

What would settle it

A model that follows the notes' classification and verification steps yet yields invalid first-order optimality conditions.

read the original abstract

In this workshop, we present a compact but rigorous introduction to the basic language of nonlinear programming, variational inequalities, and complementarity systems. The goal is twofold. First, we explain the mathematical logic of hypotheses under which first-order optimality conditions for MPECs become valid. Second, we explain how to use that theory in research practice: how to classify a model, choose the appropriate verification route, prove the right hypotheses, and derive a correct first-order analysis.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The manuscript consists of workshop notes that provide a compact introduction to nonlinear programming, variational inequalities, and complementarity systems. It explains the mathematical logic of hypotheses under which first-order optimality conditions for MPECs become valid and outlines practical steps for classifying models, selecting verification routes, proving the relevant hypotheses, and deriving correct first-order analyses.

Significance. If the exposition faithfully recapitulates established MPEC theory (including standard conditions such as strong regularity and MPCC-LICQ), the notes could serve as a useful pedagogical bridge between abstract results and research practice. The manuscript earns credit for its explicit focus on workflow and verification steps rather than new derivations, and for avoiding unsubstantiated claims. Its significance is primarily educational; it does not advance novel theorems or quantitative results.

minor comments (2)
  1. The title emphasizes 'Verification of MPEC Hypotheses' while the abstract and structure focus on explanation and classification workflows; consider a modest title adjustment for better alignment with the pedagogical emphasis.
  2. As workshop notes intended for journal publication, the manuscript would benefit from the addition of one or two concrete, worked examples illustrating the model-classification and hypothesis-verification steps to improve usability for readers.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the careful and supportive review of our workshop notes. The positive evaluation of the manuscript's pedagogical focus on MPEC hypotheses, model classification, and verification workflows is appreciated, as is the recommendation for minor revision. We will use the opportunity to polish the exposition for clarity and accessibility.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper is explicitly workshop notes providing a compact introduction to existing nonlinear programming, variational inequality, and MPEC theory. It explains standard hypotheses (e.g., strong regularity, MPCC-LICQ) under which first-order conditions hold and outlines classification/verification workflows drawn from prior literature, without claiming any novel derivations, fitted parameters, or predictions. No load-bearing step reduces to a self-definition, self-citation chain, or input-by-construction; the argument is purely expository and self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

As workshop notes on standard MPEC theory, the paper relies on background results from nonlinear programming and variational inequalities without introducing new fitted parameters or entities.

axioms (1)
  • standard math Standard assumptions and regularity conditions from nonlinear programming and variational inequality theory hold for the MPEC models discussed.
    The notes invoke these to explain when first-order conditions are valid.

pith-pipeline@v0.9.0 · 5364 in / 1130 out tokens · 55446 ms · 2026-05-09T23:43:02.760452+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. First-Order Optimality Conditions for Mathematical Programming with Equilibrium Constraints

    math.OC 2026-05 unverdicted novelty 4.0

    A geometric characterization of the tangent cone to feasible points in MPECs yields stationarity concepts and constraint qualifications that avoid the strong nondegeneracy and smoothness assumptions required by classi...

  2. Introduction to Exact Penalization for Mathematical Programming with Equilibrium Constraints

    math.OC 2026-05 unverdicted novelty 2.0

    Exact penalization for MPECs is enabled under broader conditions by fractional-order penalties derived from Lojasiewicz error bounds on KKT residual mappings.

  3. Introduction to Mathematical Programming with Equilibrium Constraints (MPECs) and Bilevel Optimization

    math.OC 2026-05 unverdicted

    An MPEC is an optimization problem whose feasible set is partly defined by another optimization, variational inequality, complementarity system, or equilibrium model.

Reference graph

Works this paper leans on

93 extracted references · 93 canonical work pages · cited by 3 Pith papers

  1. [1]

    On bilevel programming, part i: general nonlinear cases

    James E Falk and Jiming Liu. On bilevel programming, part i: general nonlinear cases. Mathematical Programming, 70(1):47–72, 1995

    work page 1995

  2. [2]

    Fully zeroth-order bilevel programming via gaussian smoothing.Journal of Optimization Theory and Applications, 205(2):31, 2025

    Alireza Aghasi and Saeed Ghadimi. Fully zeroth-order bilevel programming via gaussian smoothing.Journal of Optimization Theory and Applications, 205(2):31, 2025

    work page 2025

  3. [3]

    A two-timescale stochastic algorithm framework for bilevel optimization: Complexity analysis and application to actor- critic.SIAM Journal on Optimization, 33(1):147–180, 2023

    Mingyi Hong, Hoi-To Wai, Zhaoran Wang, and Zhuoran Yang. A two-timescale stochastic algorithm framework for bilevel optimization: Complexity analysis and application to actor- critic.SIAM Journal on Optimization, 33(1):147–180, 2023

    work page 2023

  4. [4]

    On optimization of systems governed by implicit complementarity problems.Numerical Functional Analysis and Optimization, 15(7-8):869– 887, 1994

    Michal Koˇ ccvara and Jan V Outrata. On optimization of systems governed by implicit complementarity problems.Numerical Functional Analysis and Optimization, 15(7-8):869– 887, 1994

    work page 1994

  5. [5]

    Shape derivatives for the penalty formulation of elastic contact problems with tresca friction.SIAM Journal on Control and Optimization, 58(6):3237–3261, 2020

    Bastien Chaudet-Dumas and Jean Deteix. Shape derivatives for the penalty formulation of elastic contact problems with tresca friction.SIAM Journal on Control and Optimization, 58(6):3237–3261, 2020

    work page 2020

  6. [6]

    Bidirectional endothelial feedback drives turing-vascular patterning and drug-resistance niches: a hybrid pde-agent-based study.Bioengineering, 12(10):1097, 2025

    Zonghao Liu, Louis Shuo Wang, Jiguang Yu, Jilin Zhang, Erica Martel, and Shijia Li. Bidirectional endothelial feedback drives turing-vascular patterning and drug-resistance niches: a hybrid pde-agent-based study.Bioengineering, 12(10):1097, 2025

    work page 2025

  7. [7]

    A numerical approach to optimization problems with variational inequality constraints.Mathematical Programming, 68(1):105–130, 1995

    Jiˇ r´ ı Outrata and Jochem Zowe. A numerical approach to optimization problems with variational inequality constraints.Mathematical Programming, 68(1):105–130, 1995

    work page 1995

  8. [8]

    Complexity guarantees for an implicit smoothing-enabled method for stochastic mpecs.Mathematical Programming, 198 (2):1153–1225, 2023

    Shisheng Cui, Uday V Shanbhag, and Farzad Yousefian. Complexity guarantees for an implicit smoothing-enabled method for stochastic mpecs.Mathematical Programming, 198 (2):1153–1225, 2023

    work page 2023

  9. [9]

    Constantin Christof, Juan Carlos De los Reyes, and Christian Meyer. A nonsmooth trust- region method for locally lipschitz functions with application to optimization problems constrained by variational inequalities.SIAM Journal on Optimization, 30(3):2163–2196, 2020

    work page 2020

  10. [10]

    Augmented lagrangian neural network for solving mathe- matical programs with equilibrium constraints.Journal of Optimization Theory and Ap- plications, 209(1):15, 2026

    Anjali Rawat and Vinay Singh. Augmented lagrangian neural network for solving mathe- matical programs with equilibrium constraints.Journal of Optimization Theory and Ap- plications, 209(1):15, 2026

    work page 2026

  11. [11]

    Strongly regular generalized equations.Mathematics of Operations Research, 5(1):43–62, 1980

    Stephen M Robinson. Strongly regular generalized equations.Mathematics of Operations Research, 5(1):43–62, 1980

    work page 1980

  12. [12]

    Near- optimal distributed linear-quadratic regulator for networked systems.SIAM Journal on Control and Optimization, 61(3):1113–1135, 2023

    Sungho Shin, Yiheng Lin, Guannan Qu, Adam Wierman, and Mihai Anitescu. Near- optimal distributed linear-quadratic regulator for networked systems.SIAM Journal on Control and Optimization, 61(3):1113–1135, 2023

    work page 2023

  13. [13]

    Differentiating nonsmooth solutions to parametric monotone inclusion problems.SIAM Journal on Optimization, 34 (1):71–97, 2024

    J´ erˆ ome Bolte, Edouard Pauwels, and Antonio Silveti-Falls. Differentiating nonsmooth solutions to parametric monotone inclusion problems.SIAM Journal on Optimization, 34 (1):71–97, 2024

    work page 2024

  14. [14]

    Geometric characterizations of lipschitz stability for convex optimization problems.SIAM Journal on Optimization, 35(2):927–958, 2025

    Tran TA Nghia. Geometric characterizations of lipschitz stability for convex optimization problems.SIAM Journal on Optimization, 35(2):927–958, 2025

    work page 2025

  15. [15]

    Analysis framework for stochastic predator–prey model with demographic noise.Results in Applied Mathematics, 27:100621, 2025

    Louis Shuo Wang and Jiguang Yu. Analysis framework for stochastic predator–prey model with demographic noise.Results in Applied Mathematics, 27:100621, 2025. 33

    work page 2025

  16. [16]

    Aubin property and strong regularity are equivalent for nonlinear second-order cone programming.SIAM Journal on Optimization, 35(2):712–738, 2025

    Liang Chen, Ruoning Chen, Defeng Sun, and Junyuan Zhu. Aubin property and strong regularity are equivalent for nonlinear second-order cone programming.SIAM Journal on Optimization, 35(2):712–738, 2025

    work page 2025

  17. [17]

    Strongly stable stationary solutions in nonlinear programs

    Masakazu Kojima. Strongly stable stationary solutions in nonlinear programs. InAnalysis and computation of fixed points, pages 93–138. Elsevier, 1980

    work page 1980

  18. [18]

    Characterizations of the aubin property of the solution mapping for nonlinear semidefinite programming: L

    Liang Chen, Ruoning Chen, Defeng Sun, and Liping Zhang. Characterizations of the aubin property of the solution mapping for nonlinear semidefinite programming: L. chen et al. Mathematical Programming, 215(1):637–668, 2026

    work page 2026

  19. [19]

    Lipschitz stability of least- squares problems regularized by functions with c 2-cone reducible conjugates.Mathematics of Operations Research, 2026

    Ying Cui, Tim Hoheisel, Tran TA Nghia, and Defeng Sun. Lipschitz stability of least- squares problems regularized by functions with c 2-cone reducible conjugates.Mathematics of Operations Research, 2026

    work page 2026

  20. [20]

    Exponential decay of sensitivity in graph-structured nonlinear programs.SIAM Journal on Optimization, 32(2):1156–1183, 2022

    Sungho Shin, Mihai Anitescu, and Victor M Zavala. Exponential decay of sensitivity in graph-structured nonlinear programs.SIAM Journal on Optimization, 32(2):1156–1183, 2022

    work page 2022

  21. [21]

    A function approximation approach for parametric optimization.Journal of Optimization Theory and Applications, 196(1):56–77, 2023

    Alberto De Marchi, Axel Dreves, Matthias Gerdts, Simon Gottschalk, and Sergejs Rogovs. A function approximation approach for parametric optimization.Journal of Optimization Theory and Applications, 196(1):56–77, 2023

    work page 2023

  22. [22]

    Strongly stable sta- tionary points for a class of generalized equations.SIAM Journal on Optimization, 33(2): 950–977, 2023

    Harald G¨ unzel, Daniel Hern´ andez Escobar, and Jan-J R¨ uckmann. Strongly stable sta- tionary points for a class of generalized equations.SIAM Journal on Optimization, 33(2): 950–977, 2023

    work page 2023

  23. [23]

    B Bank and J Guddat. D. klatte, b. kummer, and k. tammer: Non-linear parametric optimization, 1982

    work page 1982

  24. [24]

    Algebraic–spectral thresholds and discrete–continuous stability transfer in leslie–gower systems.Electronic Research Archive, 34(1):251–290, 2026

    Louis Shuo Wang and Jiguang Yu. Algebraic–spectral thresholds and discrete–continuous stability transfer in leslie–gower systems.Electronic Research Archive, 34(1):251–290, 2026

    work page 2026

  25. [25]

    Local analysis of newton-type methods for variational inequalities and nonlinear programming.Applied Mathematics and Optimization, 29(2):161–186, 1994

    J Fr´ ed´ eric Bonnans. Local analysis of newton-type methods for variational inequalities and nonlinear programming.Applied Mathematics and Optimization, 29(2):161–186, 1994

    work page 1994

  26. [26]

    Glob- ally convergent coderivative-based generalized newton methods in nonsmooth optimization

    Pham Duy Khanh, Boris S Mordukhovich, Vo Thanh Phat, and Dat Ba Tran. Glob- ally convergent coderivative-based generalized newton methods in nonsmooth optimization. Mathematical Programming, 205(1):373–429, 2024

    work page 2024

  27. [27]

    Two typical implementable semis- mooth* newton methods for generalized equations are g-semismooth newton methods

    Liang Chen, Defeng Sun, and Wangyongquan Zhang. Two typical implementable semis- mooth* newton methods for generalized equations are g-semismooth newton methods. Mathematics of Operations Research, 2025

    work page 2025

  28. [28]

    Variational anal- ysis of composite models with applications to continuous optimization.Mathematics of Operations Research, 47(1):397–426, 2022

    Ashkan Mohammadi, Boris S Mordukhovich, and M Ebrahim Sarabi. Variational anal- ysis of composite models with applications to continuous optimization.Mathematics of Operations Research, 47(1):397–426, 2022

    work page 2022

  29. [29]

    A generalized newton method for subgradient systems.Mathematics of Operations Research, 48(4):1811–1845, 2023

    Pham Duy Khanh, Boris Mordukhovich, and Vo Thanh Phat. A generalized newton method for subgradient systems.Mathematics of Operations Research, 48(4):1811–1845, 2023

    work page 2023

  30. [30]

    Polyhedral newton-min algorithms for complementarity problems: J.-p

    Jean-Pierre Dussault, Mathieu Frappier, and Jean Charles Gilbert. Polyhedral newton-min algorithms for complementarity problems: J.-p. dussault et al.Mathematical Programming, 215(1):269–324, 2026. 34

    work page 2026

  31. [31]

    M Seetharama Gowda and Jong-Shi Pang. Stability analysis of variational inequalities and nonlinear complementarity problems, via the mixed linear complementarity problem and degree theory.Mathematics of Operations Research, 19(4):831–879, 1994

    work page 1994

  32. [32]

    On the constant positive linear dependence condition and its application to sqp methods.SIAM Journal on Optimization, 10(4):963–981, 2000

    Liqun Qi and Zengxin Wei. On the constant positive linear dependence condition and its application to sqp methods.SIAM Journal on Optimization, 10(4):963–981, 2000

    work page 2000

  33. [33]

    On the accurate identification of active constraints.SIAM Journal on Optimization, 9(1):14–32, 1998

    Francisco Facchinei, Andreas Fischer, and Christian Kanzow. On the accurate identification of active constraints.SIAM Journal on Optimization, 9(1):14–32, 1998

    work page 1998

  34. [34]

    Global well-posedness and stability of nonlocal damage-structured lineage model with feedback and dedifferentiation

    Ye Liang, Louis Shuo Wang, Jiguang Yu, and Zonghao Liu. Global well-posedness and stability of nonlocal damage-structured lineage model with feedback and dedifferentiation. Mathematics, 13(22):3583, 2025

    work page 2025

  35. [35]

    Solution point differentiability without strict complementarity in nonlinear programming

    Krisorn Jittorntrum. Solution point differentiability without strict complementarity in nonlinear programming. InSensitivity, Stability and Parametric Analysis, pages 127–138. Springer, 2009

    work page 2009

  36. [36]

    Parametric variational inequalities with multivalued solution sets.Math- ematics of Operations Research, 17(2):341–364, 1992

    Jerzy Kyparisis. Parametric variational inequalities with multivalued solution sets.Math- ematics of Operations Research, 17(2):341–364, 1992

    work page 1992

  37. [37]

    Sensitivity analysis in nonlinear programs and variational inequalities via continuous selections.SIAM Journal on Control and Optimization, 33(4):1040–1060, 1995

    Jiming Liu. Sensitivity analysis in nonlinear programs and variational inequalities via continuous selections.SIAM Journal on Control and Optimization, 33(4):1040–1060, 1995

    work page 1995

  38. [38]

    Stability of parametric nonsmooth equations.Recent Advances in Nons- mooth Optimization, page 261, 1995

    Jong-Shi Pang 1. Stability of parametric nonsmooth equations.Recent Advances in Nons- mooth Optimization, page 261, 1995

    work page 1995

  39. [39]

    Sensitivity analysis for variational inequalities

    Yuping Qiu and Thomas L Magnanti. Sensitivity analysis for variational inequalities. Mathematics of Operations Research, 17(1):61–76, 1992

    work page 1992

  40. [40]

    Didier Aussel and Parin Chaipunya. Variational and quasi-variational inequalities under local reproducibility: solution concept and applications.Journal of Optimization Theory and Applications, 203(2):1531–1563, 2024

    work page 2024

  41. [41]

    The strong positivity conditions.Mathematics of operations research, 10 (1):54–62, 1985

    Alfonso Reinoza. The strong positivity conditions.Mathematics of operations research, 10 (1):54–62, 1985

    work page 1985

  42. [42]

    Springer, 2003

    Francisco Facchinei and Jong-Shi Pang.Finite-dimensional variational inequalities and complementarity problems. Springer, 2003

    work page 2003

  43. [43]

    Finite-dimensional variational inequality and non- linear complementarity problems: a survey of theory, algorithms and applications.Mathe- matical programming, 48(1):161–220, 1990

    Patrick T Harker and Jong-Shi Pang. Finite-dimensional variational inequality and non- linear complementarity problems: a survey of theory, algorithms and applications.Mathe- matical programming, 48(1):161–220, 1990

    work page 1990

  44. [44]

    Sensitivity analysis for nonlinear programs and variational inequalities with nonunique multipliers.Mathematics of operations research, 15(2):286–298, 1990

    Jerzy Kyparisis. Sensitivity analysis for nonlinear programs and variational inequalities with nonunique multipliers.Mathematics of operations research, 15(2):286–298, 1990

    work page 1990

  45. [45]

    Av fiacco/gp mccormick, nonlinear programming: Sequential unconstrained minimization techniques

    H Kleinmichel. Av fiacco/gp mccormick, nonlinear programming: Sequential unconstrained minimization techniques. xiv+ 210 s. m. fig. new york/london/sydney/toronto 1969. john wiley and sons, inc. preis. geb.£5, 20, 1972

    work page 1969

  46. [46]

    SIAM, 2000

    James M Ortega and Werner C Rheinboldt.Iterative solution of nonlinear equations in several variables. SIAM, 2000

    work page 2000

  47. [47]

    Analysis and mean-field limit of a hybrid pde-abm modeling angiogenesis-regulated resistance evolution.Mathematics, 13(17):2898, 2025

    Louis Shuo Wang, Jiguang Yu, Shijia Li, and Zonghao Liu. Analysis and mean-field limit of a hybrid pde-abm modeling angiogenesis-regulated resistance evolution.Mathematics, 13(17):2898, 2025. 35

    work page 2025

  48. [48]

    SIAM, 2021

    Zhong-Zhi Bai and Jian-Yu Pan.Matrix analysis and computations. SIAM, 2021

    work page 2021

  49. [49]

    Landmarks in the history of iterative methods.SIAM Review, 68(1):3–90, 2026

    Martin J Gander, Philippe Henry, and Gerhard Wanner. Landmarks in the history of iterative methods.SIAM Review, 68(1):3–90, 2026

    work page 2026

  50. [50]

    Regularized newton method with global convergence.SIAM Journal on Optimization, 33(3):1440–1462, 2023

    Konstantin Mishchenko. Regularized newton method with global convergence.SIAM Journal on Optimization, 33(3):1440–1462, 2023

    work page 2023

  51. [51]

    Super-universal regularized newton method.SIAM Journal on Optimization, 34(1):27–56, 2024

    Nikita Doikov, Konstantin Mishchenko, and Yurii Nesterov. Super-universal regularized newton method.SIAM Journal on Optimization, 34(1):27–56, 2024

    work page 2024

  52. [52]

    A low-rank admm splitting approach for semidefinite programming

    Qiushi Han, Chenxi Li, Zhenwei Lin, Caihua Chen, Qi Deng, Dongdong Ge, Huikang Liu, and Yinyu Ye. A low-rank admm splitting approach for semidefinite programming. INFORMS Journal on Computing, 2025

    work page 2025

  53. [53]

    Multi-dimensional path-dependent forward-backward stochastic variational inequalities.Set-Valued and Variational Analysis, 31(1):2, 2023

    Ning Ning and Jing Wu. Multi-dimensional path-dependent forward-backward stochastic variational inequalities.Set-Valued and Variational Analysis, 31(1):2, 2023

    work page 2023

  54. [54]

    Newton’s method for solving generalized equations without lipschitz condition.Journal of Optimization Theory and Applications, 192(2):510–532, 2022

    Jiaxi Wang and Wei Ouyang. Newton’s method for solving generalized equations without lipschitz condition.Journal of Optimization Theory and Applications, 192(2):510–532, 2022

    work page 2022

  55. [55]

    Generalized equations and their solutions, part i: Basic theory

    Stephen M Robinson. Generalized equations and their solutions, part i: Basic theory. In Point-to-Set Maps and Mathematical Programming, pages 128–141. Springer, 2009

    work page 2009

  56. [56]

    Flexible differentiable optimization via model transformations.INFORMS Journal on Computing, 36(2):456–478, 2024

    Mathieu Besan¸ con, Joaquim Dias Garcia, Benoˆ ıt Legat, and Akshay Sharma. Flexible differentiable optimization via model transformations.INFORMS Journal on Computing, 36(2):456–478, 2024

    work page 2024

  57. [57]

    Penalty decomposition methods for second-best congestion pricing problems on large-scale networks.INFORMS Journal on Computing, 37(6):1542–1559, 2025

    Lei Guo, Wenxin Zhou, Xiaolei Wang, Hai Yang, and Tijun Fan. Penalty decomposition methods for second-best congestion pricing problems on large-scale networks.INFORMS Journal on Computing, 37(6):1542–1559, 2025

    work page 2025

  58. [58]

    A globally con- vergent proximal newton-type method in nonsmooth convex optimization.Mathematical Programming, 198(1):899–936, 2023

    Boris S Mordukhovich, Xiaoming Yuan, Shangzhi Zeng, and Jin Zhang. A globally con- vergent proximal newton-type method in nonsmooth convex optimization.Mathematical Programming, 198(1):899–936, 2023

    work page 2023

  59. [59]

    Stability for nash equilibrium problems

    Ruoyu Diao, Yu-Hong Dai, and Liwei Zhang. Stability for nash equilibrium problems. Mathematics of Operations Research, 2025

    work page 2025

  60. [60]

    A damage-structured pde model of stem cell hierarchies: The dual role of dedifferentiation in tissue homeostasis and aging.Plos one, 21(2):e0335163, 2026

    Louis Shuo Wang, Jiguang Yu, and Zonghao Liu. A damage-structured pde model of stem cell hierarchies: The dual role of dedifferentiation in tissue homeostasis and aging.Plos one, 21(2):e0335163, 2026

    work page 2026

  61. [61]

    Local structure of feasible sets in nonlinear programming, part iii: Stability and sensitivity

    Stephen M Robinson. Local structure of feasible sets in nonlinear programming, part iii: Stability and sensitivity. InNonlinear Analysis and Optimization, pages 45–66. Springer, 2009

    work page 2009

  62. [62]

    Lecture note for bounded controls in continuous-time and control of several variables.arXiv e-prints, pages arXiv–2604, 2026

    Louis Shuo Wang. Lecture note for bounded controls in continuous-time and control of several variables.arXiv e-prints, pages arXiv–2604, 2026

    work page 2026

  63. [63]

    Projected gradient descent accumulates at bouli- gand stationary points.SIAM Journal on Optimization, 35(2):1004–1029, 2025

    Guillaume Olikier and Ir` ene Waldspurger. Projected gradient descent accumulates at bouli- gand stationary points.SIAM Journal on Optimization, 35(2):1004–1029, 2025

    work page 2025

  64. [64]

    Monotone inclusions, acceleration, and closed-loop con- trol.Mathematics of Operations Research, 48(4):2353–2382, 2023

    Tianyi Lin and Michael I Jordan. Monotone inclusions, acceleration, and closed-loop con- trol.Mathematics of Operations Research, 48(4):2353–2382, 2023. 36

    work page 2023

  65. [65]

    A squared smoothing newton method for semidefinite programming.Mathematics of Operations Research, 50(4):2873–2908, 2025

    Ling Liang, Defeng Sun, and Kim-Chuan Toh. A squared smoothing newton method for semidefinite programming.Mathematics of Operations Research, 50(4):2873–2908, 2025

    work page 2025

  66. [66]

    On inertia and schur complement in optimization.Linear Algebra and its Applications, 95:97–109, 1987

    H Th Jongen, T M¨ obert, J R¨ uckmann, and K Tammer. On inertia and schur complement in optimization.Linear Algebra and its Applications, 95:97–109, 1987

    work page 1987

  67. [67]

    Springer, 1990

    J¨ urgen Guddat, F Guerra Vazquez, and Hubertus Th Jongen.Parametric optimization: singularities, pathfollowing and jumps. Springer, 1990

    work page 1990

  68. [68]

    Time-varying semidefinite programming: Path following a burer–monteiro factorization.SIAM Journal on Optimization, 34(1):1–26, 2024

    Antonio Bellon, Mareike Dressler, Vyacheslav Kungurtsev, Jakub Mareˇ cek, and Andr´ e Uschmajew. Time-varying semidefinite programming: Path following a burer–monteiro factorization.SIAM Journal on Optimization, 34(1):1–26, 2024

    work page 2024

  69. [69]

    Running primal- dual gradient method for time-varying nonconvex problems.SIAM Journal on Control and Optimization, 60(4):1970–1990, 2022

    Yujie Tang, Emiliano Dall’Anese, Andrey Bernstein, and Steven Low. Running primal- dual gradient method for time-varying nonconvex problems.SIAM Journal on Control and Optimization, 60(4):1970–1990, 2022

    work page 1970

  70. [70]

    New methods for parametric optimization via differential equations.SIAM Journal on Optimization, 35(3):1524–1550, 2025

    Heyuan Liu and Paul Grigas. New methods for parametric optimization via differential equations.SIAM Journal on Optimization, 35(3):1524–1550, 2025

    work page 2025

  71. [71]

    Newton’s method for generalized equations

    Norman H Josephy. Newton’s method for generalized equations. Technical report, 1979

    work page 1979

  72. [72]

    A riemannian proximal newton method.SIAM Journal on Optimization, 34(1):654–681, 2024

    Wutao Si, P-A Absil, Wen Huang, Rujun Jiang, and Simon Vary. A riemannian proximal newton method.SIAM Journal on Optimization, 34(1):654–681, 2024

    work page 2024

  73. [73]

    Relative lipschitz-like property of parametric systems via projectional coderivatives.SIAM Journal on Optimization, 33(3):2021–2040, 2023

    Wenfang Yao and Xiaoqi Yang. Relative lipschitz-like property of parametric systems via projectional coderivatives.SIAM Journal on Optimization, 33(3):2021–2040, 2023

    work page 2021

  74. [74]

    Continuous selections of solutions to parametric varia- tional inequalities.SIAM Journal on Optimization, 34(1):870–892, 2024

    Shaoning Han and Jong-Shi Pang. Continuous selections of solutions to parametric varia- tional inequalities.SIAM Journal on Optimization, 34(1):870–892, 2024

    work page 2024

  75. [75]

    Application of degree theory in stability of the complementarity problem

    Cu Duong Ha. Application of degree theory in stability of the complementarity problem. Mathematics of Operations Research, 12(2):368–376, 1987

    work page 1987

  76. [76]

    Jiguang Yu, Louis Shuo Wang, Zonghao Liu, and Jingfeng Liu. Pattern suppression and recovery under one-way versus two-way chemotactic coupling in hybrid partial differential equation–ordinary differential equation models.Transport Phenomena, (0), 2026

    work page 2026

  77. [77]

    Continuous deformation of nonlinear pro- grams

    Masakazu Kojima and Ryuichi Hirabayashi. Continuous deformation of nonlinear pro- grams. InSensitivity, Stability and Parametric Analysis, pages 150–198. Springer, 2009

    work page 2009

  78. [78]

    Continuation methods for riemannian optimization

    Axel S´ eguin and Daniel Kressner. Continuation methods for riemannian optimization. SIAM Journal on Optimization, 32(2):1069–1093, 2022

    work page 2022

  79. [79]

    PhD thesis, George Washington University, 1995

    Jiming Liu.Perturbation analysis in nonlinear programs and variational inequalities. PhD thesis, George Washington University, 1995

    work page 1995

  80. [80]

    Piecewise smoothness, local invertibility, and parametric analysis of normal maps.Mathematics of operations research, 21(2):401–426, 1996

    Jong-Shi Pang and Daniel Ralph. Piecewise smoothness, local invertibility, and parametric analysis of normal maps.Mathematics of operations research, 21(2):401–426, 1996

    work page 1996

Showing first 80 references.