Quantifier elimination for normal cone computations

DOI10.1016/J.JSC.2025.102456MaRDI QIDQ6968348zbMATH OpenFDO

Authors Michael Mandlmayr, Ali Kemal Uncu

Publication date 24 June 2025

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JSC.2025.102456

zbMATH Keywords

co-derivativescylindrical algebraic decompositionnonlinear programmingnormal cone mappingquantifier elimination

Mathematics Subject Classification ID

Quantifier elimination, model completeness, and related topics (03C10) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Newton-type methods (49M15) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15) Optimization of other properties in solid mechanics (74P10) Polynomial optimization (90C23) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Methods of quasi-Newton type (90C53)

Cites work

• A model-constructing satisfiability calculus
• An Invitation to Tame Optimization
• Bi-level strategies in semi-infinite programming.
• Disjunctive Programming
• Enhancements to Lazard's method for cylindrical algebraic decomposition
• scientific article; zbMATH DE number 3497890 (Why is no real title available?)
• scientific article; zbMATH DE number 589124 (Why is no real title available?)
• New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints
• On (local) analysis of multifunctions via subspaces contained in graphs of generalized derivatives
• On a Semismooth* Newton Method for Solving Generalized Equations
• On the application of the SCD semismooth* Newton method to variational inequalities of the second kind
• On the SCD semismooth* Newton method for generalized equations with application to a class of static contact problems with Coulomb friction
• Optimality conditions for disjunctive programs based on generalized differentiation with application to mathematical programs with equilibrium constraints
• Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
• Parametric toricity of steady state varieties of reaction networks
• Real quantifier elimination is doubly exponential
• Stochastic subgradient method converges on tame functions
• The complexity of quantifier elimination and cylindrical algebraic decomposition
• The DEWCAD project
• TheoryGuru: a Mathematica package to apply quantifier elimination technology to economics
• Variational Analysis
• Variational analysis and applications
• Variational analysis of regular mappings. Theory and applications

This page was built for publication: Quantifier elimination for normal cone computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6968348)