pith. sign in

arxiv: 2605.00387 · v1 · submitted 2026-05-01 · 🧮 math.OC

Introduction to Exact Penalization for Mathematical Programming with Equilibrium Constraints

Louis Shuo Wang This is my paper

Pith reviewed 2026-05-09 19:28 UTC · model grok-4.3

classification 🧮 math.OC
keywords exact penalizationMPECerror boundsLojasiewicz inequalitysubanalytic geometryKKT systemmathematical programmingequilibrium constraints
0
0 comments X

The pith

Exact penalization for MPECs holds via Lojasiewicz error bounds on KKT residuals beyond classical regularity.

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

This paper introduces exact penalty methods for nonlinear programs and mathematical programs with equilibrium constraints by linking them to error bound theory. It demonstrates that classical optimality conditions rely on regularity assumptions which can be seen as error bounds, but recent results using subanalytic geometry and Lojasiewicz inequalities extend exact penalization to broader cases. The theory is applied to MPECs through KKT reformulations and residual-based penalties, including fractional orders, to provide both insight and practical tools for constrained optimization problems.

Core claim

The central discovery is that exact penalty functions for MPECs can be built from the residuals of their KKT systems, with the order of the penalty determined by Lojasiewicz-type error bounds that hold under subanalytic assumptions, thereby relaxing the need for traditional constraint qualifications.

What carries the argument

Lojasiewicz error bounds applied to residual mappings of KKT systems, enabling fractional-order exact penalties.

Load-bearing premise

The problems or their KKT residuals satisfy subanalytic set properties or Lojasiewicz error bounds that guarantee the exactness of the corresponding penalty functions.

What would settle it

A concrete MPEC whose KKT residual mapping violates every Lojasiewicz inequality, for which no exact penalty function exists at any finite order.

read the original abstract

We present a focused introduction to exact penalty methods for nonlinear programs and mathematical programs with equilibrium constraints (MPECs), emphasizing their connection to modern error bound theory. The goal is twofold. First, we explain how classical optimality conditions can be interpreted through exact penalization, and why such results typically rely on constraint regularity conditions that can be understood as error bounds on perturbations of feasible sets. We then highlight how recent developments based on subanalytic geometry and Lojasiewicz-type inequalities extend this framework beyond classical regularity assumptions, enabling exact penalization under broader analytic conditions. Second, we demonstrate how this theory can be applied in practice to MPECs by reformulating them via KKT systems and constructing exact penalty functions based on residual mappings. Particular attention is given to fractional-order penalties arising from Lojasiewicz error bounds, as well as to improved formulations for special problem classes where sharper exponents can be obtained. These developments provide both theoretical insight and practical guidance for analyzing and solving challenging constrained optimization problems.

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 / 3 minor

Summary. The manuscript is an introductory survey on exact penalty methods for nonlinear programs and mathematical programs with equilibrium constraints (MPECs). It recasts classical optimality conditions and exact penalization results in terms of error bounds on feasible-set perturbations, then extends the framework using subanalytic geometry and Łojasiewicz-type inequalities to obtain exact penalization under weaker analytic assumptions. The second part applies the theory to MPECs by reformulating them as KKT systems and constructing residual-based penalty functions, with emphasis on fractional-order penalties and sharper exponents for special problem classes.

Significance. As a focused synthesis, the paper usefully connects classical exact-penalty theory to modern error-bound and subanalytic tools, providing both theoretical perspective and practical guidance for MPEC analysis. When the cited Łojasiewicz exponents hold, the fractional penalties are exact by construction; the manuscript correctly notes that it does not claim the property for every MPEC but only demonstrates the framework when the bound is satisfied. This makes the work a serviceable entry point for researchers already familiar with basic KKT theory.

minor comments (3)
  1. The abstract states that the developments 'provide both theoretical insight and practical guidance,' yet the manuscript contains no numerical examples or implementation details; a short illustrative MPEC with explicit residual mapping and computed penalty exponent would strengthen the practical-utility claim without lengthening the survey.
  2. Notation for the residual mapping and the fractional exponent p is introduced in the KKT-reformulation section but is not collected in a single table or list of symbols; adding such a reference would improve readability for readers who consult the paper selectively.
  3. The discussion of 'sharper exponents for special problem classes' refers to prior literature but does not restate the precise conditions (e.g., strong regularity or polyhedrality) under which the exponent improves; a one-paragraph recap with a forward reference would clarify the improvement.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive evaluation of the manuscript and for recommending minor revision. The referee's summary accurately captures the paper's scope, its connection between classical exact-penalty theory and modern error-bound techniques, and the focus on fractional-order penalties for MPECs. As no specific major comments were raised in the report, we will incorporate any minor editorial or presentational improvements in the revised version.

Circularity Check

0 steps flagged

No significant circularity; survey of external results

full rationale

The paper is explicitly an introductory survey that recasts classical exact penalization via KKT residuals and error bounds, then invokes existing subanalytic geometry and Lojasiewicz literature for extensions. No derivation chain reduces a claimed result to a fitted parameter, self-definition, or self-citation chain by construction; the central claims are conditional on the external error-bound assumptions holding and point to prior work rather than deriving them internally.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The paper relies on standard domain assumptions from optimization theory and real algebraic geometry without introducing new free parameters or postulated entities.

axioms (2)
  • domain assumption Classical optimality conditions can be interpreted through exact penalization when constraint regularity conditions act as error bounds on perturbations of feasible sets.
    Explicitly stated as the foundation for the first part of the introduction.
  • domain assumption Subanalytic geometry and Lojasiewicz-type inequalities apply to the problems considered, enabling broader exact penalization.
    Invoked to extend the framework beyond classical regularity assumptions.

pith-pipeline@v0.9.0 · 5460 in / 1327 out tokens · 35412 ms · 2026-05-09T19:28:12.044384+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 1 Pith paper

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

  1. A Diagnostic Framework for Implementation Risk in Bilevel Decision Problems: The Ambiguity Premium and the Robustness--Efficiency Frontier

    math.OC 2026-05 unverdicted novelty 6.0

    The paper defines the ambiguity premium Δ_ε(x) as the gap between pessimistic and optimistic upper-level values over ε-optimal follower responses and provides bounds plus a screening workflow to trace robustness-effic...

Reference graph

Works this paper leans on

99 extracted references · 99 canonical work pages · cited by 1 Pith paper · 3 internal anchors

  1. [1]

    Mathematical Programming70(1), 47–72 (1995)

    Falk, J.E., Liu, J.: On bilevel programming, part i: general nonlinear cases. Mathematical Programming70(1), 47–72 (1995)

    work page 1995

  2. [2]

    Journal of Optimization Theory and Applications205(2), 31 (2025)

    Aghasi, A., Ghadimi, S.: Fully zeroth-order bilevel programming via gaussian smoothing. Journal of Optimization Theory and Applications205(2), 31 (2025)

    work page 2025

  3. [3]

    SIAM Journal on Optimization33(1), 147–180 (2023)

    Hong, M., Wai, H.-T., Wang, Z., Yang, Z.: A two-timescale stochastic algorithm framework for bilevel optimization: Complexity analysis and application to actor- critic. SIAM Journal on Optimization33(1), 147–180 (2023)

    work page 2023

  4. [4]

    Numerical Functional Analysis and Optimization 15(7-8), 869–887 (1994)

    Koˇ ccvara, M., Outrata, J.V.: 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]

    SIAM Journal on Control and Optimization58(6), 3237–3261 (2020)

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

    work page 2020

  6. [6]

    In: 2023 62nd IEEE Conference on Decision and Control (CDC), pp

    Liu, S., Xiao, W., Belta, C.A.: Auxiliary-variable adaptive control barrier func- tions for safety critical systems. In: 2023 62nd IEEE Conference on Decision and Control (CDC), pp. 8602–8607 (2023). IEEE

    work page 2023

  7. [7]

    Bioengineering12(10), 1097 (2025)

    Liu, Z., Wang, L.S., Yu, J., Zhang, J., Martel, E., Li, S.: Bidirectional endothelial feedback drives turing-vascular patterning and drug-resistance niches: a hybrid pde-agent-based study. Bioengineering12(10), 1097 (2025)

    work page 2025

  8. [8]

    Mathematical Programming68(1), 105–130 (1995)

    Outrata, J., Zowe, J.: A numerical approach to optimization problems with variational inequality constraints. Mathematical Programming68(1), 105–130 (1995)

    work page 1995

  9. [9]

    Mathematical Programming 198(2), 1153–1225 (2023)

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

    work page 2023

  10. [10]

    SIAM Journal on Optimization30(3), 2163–2196 (2020) 21

    Christof, C., Reyes, J.C., Meyer, C.: A nonsmooth trust-region method for locally lipschitz functions with application to optimization problems constrained by variational inequalities. SIAM Journal on Optimization30(3), 2163–2196 (2020) 21

    work page 2020

  11. [11]

    Journal of Optimization Theory and Applications209(1), 15 (2026)

    Rawat, A., Singh, V.: Augmented lagrangian neural network for solving mathe- matical programs with equilibrium constraints. Journal of Optimization Theory and Applications209(1), 15 (2026)

    work page 2026

  12. [12]

    Mathematics of Opera- tions Research5(1), 43–62 (1980)

    Robinson, S.M.: Strongly regular generalized equations. Mathematics of Opera- tions Research5(1), 43–62 (1980)

    work page 1980

  13. [13]

    SIAM Journal on Control and Optimization61(3), 1113–1135 (2023)

    Shin, S., Lin, Y., Qu, G., Wierman, A., Anitescu, M.: Near-optimal distributed linear-quadratic regulator for networked systems. SIAM Journal on Control and Optimization61(3), 1113–1135 (2023)

    work page 2023

  14. [14]

    SIAM Journal on Optimization34(1), 71–97 (2024)

    Bolte, J., Pauwels, E., Silveti-Falls, A.: Differentiating nonsmooth solutions to parametric monotone inclusion problems. SIAM Journal on Optimization34(1), 71–97 (2024)

    work page 2024

  15. [15]

    Results in Applied Mathematics27, 100621 (2025)

    Wang, L.S., Yu, J.: Analysis framework for stochastic predator–prey model with demographic noise. Results in Applied Mathematics27, 100621 (2025)

    work page 2025

  16. [16]

    SIAM Journal on Optimization35(2), 712–738 (2025)

    Chen, L., Chen, R., Sun, D., Zhu, J.: Aubin property and strong regularity are equivalent for nonlinear second-order cone programming. SIAM Journal on Optimization35(2), 712–738 (2025)

    work page 2025

  17. [17]

    In: 2024 IEEE 63rd Conference on Decision and Control (CDC), pp

    Liu, S., Xiao, W., Belta, C.A.: Auxiliary-variable adaptive control lyapunov bar- rier functions for spatio-temporally constrained safety-critical applications. In: 2024 IEEE 63rd Conference on Decision and Control (CDC), pp. 8098–8104 (2024). IEEE

    work page 2024

  18. [18]

    In: Analysis and Computation of Fixed Points, pp

    Kojima, M.: Strongly stable stationary solutions in nonlinear programs. In: Analysis and Computation of Fixed Points, pp. 93–138. Elsevier, ??? (1980)

    work page 1980

  19. [19]

    chen et al

    Chen, L., Chen, R., Sun, D., Zhang, L.: Characterizations of the aubin property of the solution mapping for nonlinear semidefinite programming: L. chen et al. Mathematical Programming215(1), 637–668 (2026)

    work page 2026

  20. [20]

    Mathemat- ics of Operations Research (2026)

    Cui, Y., Hoheisel, T., Nghia, T.T., Sun, D.: Lipschitz stability of least-squares problems regularized by functions with c 2-cone reducible conjugates. Mathemat- ics of Operations Research (2026)

    work page 2026

  21. [21]

    SIAM Journal on Optimization32(2), 1156–1183 (2022)

    Shin, S., Anitescu, M., Zavala, V.M.: Exponential decay of sensitivity in graph- structured nonlinear programs. SIAM Journal on Optimization32(2), 1156–1183 (2022)

    work page 2022

  22. [22]

    Journal of Optimization Theory and Applications196(1), 56–77 (2023)

    De Marchi, A., Dreves, A., Gerdts, M., Gottschalk, S., Rogovs, S.: A function approximation approach for parametric optimization. Journal of Optimization Theory and Applications196(1), 56–77 (2023)

    work page 2023

  23. [23]

    Klatte, B

    Bank, B., Guddat, J.: D. Klatte, B. Kummer, and K. Tammer: Non-Linear 22 Parametric Optimization (1982)

    work page 1982

  24. [24]

    Electronic Research Archive34(1), 251–290 (2026)

    Wang, L.S., Yu, J.: Algebraic–spectral thresholds and discrete–continuous stabil- ity transfer in leslie–gower systems. Electronic Research Archive34(1), 251–290 (2026)

    work page 2026

  25. [25]

    Applied Mathematics and Optimization29(2), 161– 186 (1994)

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

    work page 1994

  26. [26]

    Mathematical Programming205(1), 373–429 (2024)

    Khanh, P.D., Mordukhovich, B.S., Phat, V.T., Tran, D.B.: Globally conver- gent coderivative-based generalized newton methods in nonsmooth optimization. Mathematical Programming205(1), 373–429 (2024)

    work page 2024

  27. [27]

    Mathematics of Operations Research (2025)

    Chen, L., Sun, D., Zhang, W.: Two typical implementable semismooth* new- ton methods for generalized equations are g-semismooth newton methods. Mathematics of Operations Research (2025)

    work page 2025

  28. [28]

    Mathematics of Operations Research47(1), 397–426 (2022)

    Mohammadi, A., Mordukhovich, B.S., Sarabi, M.E.: Variational analysis of com- posite models with applications to continuous optimization. Mathematics of Operations Research47(1), 397–426 (2022)

    work page 2022

  29. [29]

    dussault et al

    Dussault, J.-P., Frappier, M., Gilbert, J.C.: Polyhedral newton-min algorithms for complementarity problems: J.-p. dussault et al. Mathematical Programming 215(1), 269–324 (2026)

    work page 2026

  30. [30]

    Mathematics of Operations Research19(4), 831–879 (1994)

    Gowda, M.S., Pang, J.-S.: Stability analysis of variational inequalities and non- linear complementarity problems, via the mixed linear complementarity problem and degree theory. Mathematics of Operations Research19(4), 831–879 (1994)

    work page 1994

  31. [31]

    IEEE Open Journal of Control Systems (2025)

    Liu, S., Huang, Z., Zeng, J., Sreenath, K., Belta, C.A.: Learning-enabled itera- tive convex optimization for safety-critical model predictive control. IEEE Open Journal of Control Systems (2025)

    work page 2025

  32. [32]

    SIAM Journal on Optimization10(4), 963–981 (2000)

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

    work page 2000

  33. [33]

    SIAM Journal on Optimization9(1), 14–32 (1998)

    Facchinei, F., Fischer, A., Kanzow, C.: On the accurate identification of active constraints. SIAM Journal on Optimization9(1), 14–32 (1998)

    work page 1998

  34. [34]

    In: Sensitivity, Stability and Parametric Analysis, pp

    Jittorntrum, K.: Solution point differentiability without strict complementarity in nonlinear programming. In: Sensitivity, Stability and Parametric Analysis, pp. 127–138. Springer, ??? (2009)

    work page 2009

  35. [35]

    Mathematics of Operations Research17(2), 341–364 (1992) 23

    Kyparisis, J.: Parametric variational inequalities with multivalued solution sets. Mathematics of Operations Research17(2), 341–364 (1992) 23

    work page 1992

  36. [36]

    Recent Advances in Nonsmooth Optimization, 261 (1995)

    Pang 1, J.-S.: Stability of parametric nonsmooth equations. Recent Advances in Nonsmooth Optimization, 261 (1995)

    work page 1995

  37. [37]

    In: 2025 IEEE 64th Conference on Decision and Control (CDC), pp

    Liu, S., Belta, C.A.: Risk-aware adaptive control barrier functions for safe control of nonlinear systems under stochastic uncertainty. In: 2025 IEEE 64th Conference on Decision and Control (CDC), pp. 4875–4881 (2025). IEEE

    work page 2025

  38. [38]

    In: 2024 IEEE 63rd Conference on Decision and Control (CDC), pp

    Liu, S., Xiao, W., Belta, C.: Feasibility-guaranteed safety-critical control with applications to heterogeneous platoons. In: 2024 IEEE 63rd Conference on Decision and Control (CDC), pp. 8066–8073 (2024). IEEE

    work page 2024

  39. [39]

    Mathe- matics of Operations Research17(1), 61–76 (1992)

    Qiu, Y., Magnanti, T.L.: Sensitivity analysis for variational inequalities. Mathe- matics of Operations Research17(1), 61–76 (1992)

    work page 1992

  40. [40]

    Journal of Optimization Theory and Applications203(2), 1531–1563 (2024)

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

    work page 2024

  41. [41]

    Mathematics of operations research 10(1), 54–62 (1985)

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

    work page 1985

  42. [42]

    Springer, ??? (2003)

    Facchinei, F., Pang, J.-S.: Finite-dimensional Variational Inequalities and Com- plementarity Problems. Springer, ??? (2003)

    work page 2003

  43. [43]

    Mathematical programming48(1), 161–220 (1990)

    Harker, P.T., Pang, J.-S.: Finite-dimensional variational inequality and nonlin- ear complementarity problems: a survey of theory, algorithms and applications. Mathematical programming48(1), 161–220 (1990)

    work page 1990

  44. [44]

    Mathematics of operations research15(2), 286–298 (1990)

    Kyparisis, J.: Sensitivity analysis for nonlinear programs and variational inequal- ities with nonunique multipliers. Mathematics of operations research15(2), 286–298 (1990)

    work page 1990

  45. [45]

    Information Technology and Control54(2), 413–438 (2025)

    Wang, Z., Wang, D., Yu, J.: Multi-strategy hybrid improved intelligent algorithm for solving uav-mtsp. Information Technology and Control54(2), 413–438 (2025)

    work page 2025

  46. [46]

    XIV+ 210 S

    Kleinmichel, H.: AV Fiacco/GP McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques. XIV+ 210 S. m. Fig. New York/Lon- don/Sydney/Toronto 1969. John Wiley and Sons, Inc. Preis. geb.£5, 20. Wiley Online Library (1972)

    work page 1969

  47. [47]

    SIAM, ??? (2000)

    Ortega, J.M., Rheinboldt, W.C.: Iterative Solution of Nonlinear Equations in Several Variables. SIAM, ??? (2000)

    work page 2000

  48. [48]

    Mathematics13(17), 2898 (2025)

    Wang, L.S., Yu, J., Li, S., Liu, Z.: Analysis and mean-field limit of a hybrid pde- abm modeling angiogenesis-regulated resistance evolution. Mathematics13(17), 2898 (2025)

    work page 2025

  49. [49]

    SIAM, ??? (2021) 24

    Bai, Z.-Z., Pan, J.-Y.: Matrix Analysis and Computations. SIAM, ??? (2021) 24

    work page 2021

  50. [50]

    IEEE Transactions on Vehicular Technology (2026)

    Lin, Z., Lan, J., Liu, S., Tian, Z., Zhao, D., Wei, C.: Hierarchical multi-agent mcts for safety-critical coordination in mixed-autonomy roundabouts. IEEE Transactions on Vehicular Technology (2026)

    work page 2026

  51. [51]

    In: 2022 International Conference on Data Analytics, Computing and Artificial Intelligence (ICDACAI), pp

    Gao, Y., Li, L., Yu, J.: Rolling prediction model of closing price based on eemd data noise reduction and hgs-delm. In: 2022 International Conference on Data Analytics, Computing and Artificial Intelligence (ICDACAI), pp. 255–260 (2022). IEEE

    work page 2022

  52. [52]

    SIAM Review68(1), 3–90 (2026)

    Gander, M.J., Henry, P., Wanner, G.: Landmarks in the history of iterative methods. SIAM Review68(1), 3–90 (2026)

    work page 2026

  53. [53]

    SIAM Journal on Optimization33(3), 1440–1462 (2023)

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

    work page 2023

  54. [54]

    SIAM Journal on Optimization34(1), 27–56 (2024)

    Doikov, N., Mishchenko, K., Nesterov, Y.: Super-universal regularized newton method. SIAM Journal on Optimization34(1), 27–56 (2024)

    work page 2024

  55. [55]

    INFORMS Journal on Computing (2025)

    Han, Q., Li, C., Lin, Z., Chen, C., Deng, Q., Ge, D., Liu, H., Ye, Y.: A low-rank admm splitting approach for semidefinite programming. INFORMS Journal on Computing (2025)

    work page 2025

  56. [56]

    Set-Valued and Variational Analysis31(1), 2 (2023)

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

    work page 2023

  57. [57]

    Journal of Optimization Theory and Applications192(2), 510–532 (2022)

    Wang, J., Ouyang, W.: Newton’s method for solving generalized equations with- out lipschitz condition. Journal of Optimization Theory and Applications192(2), 510–532 (2022)

    work page 2022

  58. [58]

    In: Point-to-Set Maps and Mathematical Programming, pp

    Robinson, S.M.: Generalized equations and their solutions, part i: Basic theory. In: Point-to-Set Maps and Mathematical Programming, pp. 128–141. Springer, ??? (2009)

    work page 2009

  59. [59]

    Mathematical Programming198(1), 899–936 (2023)

    Mordukhovich, B.S., Yuan, X., Zeng, S., Zhang, J.: A globally convergent prox- imal newton-type method in nonsmooth convex optimization. Mathematical Programming198(1), 899–936 (2023)

    work page 2023

  60. [60]

    Plos one 21(2), 0335163 (2026)

    Wang, L.S., Yu, J., Liu, Z.: A damage-structured pde model of stem cell hierar- chies: The dual role of dedifferentiation in tissue homeostasis and aging. Plos one 21(2), 0335163 (2026)

    work page 2026

  61. [61]

    In: Nonlinear Analysis and Optimization, pp

    Robinson, S.M.: Local structure of feasible sets in nonlinear programming, part iii: Stability and sensitivity. In: Nonlinear Analysis and Optimization, pp. 45–66. Springer, ??? (2009)

    work page 2009

  62. [62]

    arXiv e-prints, 2604 (2026) 25

    Shuo Wang, L.: Lecture note for bounded controls in continuous-time and control of several variables. arXiv e-prints, 2604 (2026) 25

    work page 2026

  63. [63]

    Mathematics of Operations Research48(4), 2353–2382 (2023)

    Lin, T., Jordan, M.I.: Monotone inclusions, acceleration, and closed-loop control. Mathematics of Operations Research48(4), 2353–2382 (2023)

    work page 2023

  64. [64]

    Optimization Workshop Notes for Mathematical Programming with Equilibrium Constraints (MPECs): Second-Order Optimality Conditions

    Yu, J.: Optimization workshop notes for mathematical programming with equi- librium constraints (mpecs): Second-order optimality conditions. arXiv preprint arXiv:2604.20992 (2026)

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  65. [65]

    Mathematics of Operations Research50(4), 2873–2908 (2025)

    Liang, L., Sun, D., Toh, K.-C.: A squared smoothing newton method for semidef- inite programming. Mathematics of Operations Research50(4), 2873–2908 (2025)

    work page 2025

  66. [66]

    Linear Algebra and its Applications95, 97–109 (1987)

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

    work page 1987

  67. [67]

    Springer, ??? (1990)

    Guddat, J., Vazquez, F.G., Jongen, H.T.: Parametric Optimization: Singularities, Pathfollowing and Jumps. Springer, ??? (1990)

    work page 1990

  68. [68]

    SIAM Journal on Optimization34(1), 1–26 (2024)

    Bellon, A., Dressler, M., Kungurtsev, V., Mareˇ cek, J., Uschmajew, A.: Time- varying semidefinite programming: Path following a burer–monteiro factorization. SIAM Journal on Optimization34(1), 1–26 (2024)

    work page 2024

  69. [69]

    SIAM Journal on Control and Optimization60(4), 1970–1990 (2022)

    Tang, Y., Dall’Anese, E., Bernstein, A., Low, S.: Running primal-dual gradient method for time-varying nonconvex problems. SIAM Journal on Control and Optimization60(4), 1970–1990 (2022)

    work page 1970

  70. [70]

    SIAM Journal on Optimization35(3), 1524–1550 (2025)

    Liu, H., Grigas, P.: New methods for parametric optimization via differential equations. SIAM Journal on Optimization35(3), 1524–1550 (2025)

    work page 2025

  71. [71]

    Technical report (1979)

    Josephy, N.H.: Newton’s method for generalized equations. Technical report (1979)

    work page 1979

  72. [72]

    SIAM Journal on Optimization34(1), 654–681 (2024)

    Si, W., Absil, P.-A., Huang, W., Jiang, R., Vary, S.: A riemannian proximal newton method. SIAM Journal on Optimization34(1), 654–681 (2024)

    work page 2024

  73. [73]

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

    Yu, J.: Optimization workshop notes for mathematical programming with equi- librium constraints (mpecs): Verification of mpec hypotheses. arXiv preprint arXiv:2604.20988 (2026)

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  74. [74]

    arXiv preprint arXiv:2307.15912 (2023)

    Longman, R.W., Liu, S., Elsharhawy, T.A.: A method to speed up convergence of iterative learning control for high precision repetitive motions. arXiv preprint arXiv:2307.15912 (2023)

    work page arXiv 2023

  75. [75]

    SIAM Journal on Optimization33(3), 2021–2040 (2023)

    Yao, W., Yang, X.: Relative lipschitz-like property of parametric systems via projectional coderivatives. SIAM Journal on Optimization33(3), 2021–2040 (2023)

    work page 2021

  76. [76]

    SIAM Journal on Optimization34(1), 870–892 (2024)

    Han, S., Pang, J.-S.: Continuous selections of solutions to parametric variational 26 inequalities. SIAM Journal on Optimization34(1), 870–892 (2024)

    work page 2024

  77. [77]

    Mathematics of Operations Research12(2), 368–376 (1987)

    Ha, C.D.: Application of degree theory in stability of the complementarity problem. Mathematics of Operations Research12(2), 368–376 (1987)

    work page 1987

  78. [78]

    Transport Phenomena (0) (2026)

    Yu, J., Wang, L.S., Liu, Z., Liu, J.: 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

  79. [79]

    In: Sensitivity, Stability and Parametric Analysis, pp

    Kojima, M., Hirabayashi, R.: Continuous deformation of nonlinear programs. In: Sensitivity, Stability and Parametric Analysis, pp. 150–198. Springer, ??? (2009)

    work page 2009

  80. [80]

    SIAM Journal on Optimization32(2), 1069–1093 (2022)

    S´ eguin, A., Kressner, D.: Continuation methods for riemannian optimization. SIAM Journal on Optimization32(2), 1069–1093 (2022)

    work page 2022

Showing first 80 references.