Genericity in polynomial optimization
From MaRDI portal
Recommendations
Cited in
(52)- Error bounds for the solution sets of quadratic complementarity problems
- Genericity and Hölder stability in semi-algebraic variational inequalities
- The global weak sharp minima with explicit exponents in polynomial vector optimization problems
- Compactness criteria for real algebraic sets and Newton polyhedra
- A note on nondegenerate matrix polynomials
- Multi-objective convex polynomial optimization and semidefinite programming relaxations
- The set of separable states has no finite semidefinite representation except in dimension \(3\times 2\)
- Error bounds of regularized gap functions for polynomial variational inequalities
- Existence of Pareto solutions for vector polynomial optimization problems with constraints
- Existence of efficient and properly efficient solutions to problems of constrained vector optimization
- Complementary problems with polynomial data
- Polynomial optimization on some unbounded closed semi-algebraic sets
- Bifurcation sets and global monodromies of Newton nondegenerate polynomials on algebraic sets
- On types of degenerate critical points of real polynomial functions
- On Lipschitz rigidity of complex analytic sets
- On the existence of Pareto solutions for polynomial vector optimization problems
- Global Łojasiewicz inequalities on comparing the rate of growth of polynomial functions
- Lipschitz continuity of tangent directions at infinity
- Local minimizers of semi-algebraic functions from the viewpoint of tangencies
- Qualification Conditions in Semialgebraic Programming
- Stability of closedness of closed convex sets under linear mappings
- Openness, Hölder metric regularity, and Hölder continuity properties of semialgebraic set-valued maps
- Stability of closedness of semi-algebraic sets under continuous semi-algebraic mappings
- An application of the Tarski-Seidenberg theorem with quantifiers to vector variational inequalities
- Optimality conditions for minimizers at infinity in polynomial programming
- Global mixed Łojasiewicz inequalities and asymptotic critical values
- Definable continuous mappings and Whyburn’s conjecture
- Solvability of a regular polynomial vector optimization problem without convexity
- Error bounds for the solution sets of generalized polynomial complementarity problems
- Tangencies and polynomial optimization
- Lyapunov stability of the subgradient method with constant step size
- Convergence of the Momentum Method for Semialgebraic Functions with Locally Lipschitz Gradients
- Moment and Polynomial Optimization
- A new scheme for approximating the weakly efficient solution set of vector rational optimization problems
- Certifying the Absence of Spurious Local Minima at Infinity
- Real Algebraic Geometry and Optimization
- On types of isolated KKT points in polynomial optimization
- Generalized semi-infinite polynomial optimization and semidefinite programming relaxations
- A new random reshuffling method for nonsmooth nonconvex finite-sum optimization
- Semi-algebraic geometry and generic Hamiltonian stability
- Existence of solutions for a relative regularity/non-regularity polynomial vector optimization problem
- The mountain pass theorem in terms of tangencies
- Atypical values at infinity of real polynomial maps with 2-dimensional fibers
- Representation of positive polynomials on a generalized strip and its application to polynomial optimization
- Solution existence for a class of nonsmooth robust optimization problems
- Flat extension technique for moment matrices of positive linear functionals over mixed polynomials and an application in quantum information
- On the complexity of matrix Putinar's Positivstellensätz
- Limits of real bivariate rational functions
- The rank-1 completion problem for cubic tensors
- Characterizing stability of parametric nonconvex polynomial optimization problems under total perturbations
- Existence of weak Pareto efficient solutions of a multiobjective optimization problem under a closed constraint set
- Local error bounds for the generalized polynomial complementarity problem
This page was built for publication: Genericity in polynomial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2967821)
