Image de couverture de livre

Hesse's Redemption: Efficient Convex Polynomial Programming

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Slot, Lucas, Steurer, David, Wiedmer, Manuel
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms Computational Complexity Algebraic Geometry Optimization and Control 90C23, 90C25, 14P10 F.2.0; G.1.6
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization based on push-forward measures
par: Slot, Lucas, et autres
Publié: (2024)

On the convergence of critical points on real algebraic sets and applications to optimization
par: Basu, Saugata, et autres
Publié: (2025)

Degree bounds for Putinar's Positivstellensatz on the hypercube
par: Baldi, Lorenzo, et autres
Publié: (2023)

Computational complexity of sum-of-squares bounds for copositive programs
par: Palomba, Marilena, et autres
Publié: (2025)

Disjunctive Sum of Squares
par: Ahmadi, Amir Ali, et autres
Publié: (2026)

On odd powers of nonnegative polynomials that are not sums of squares
par: Blekherman, Grigoriy, et autres
Publié: (2024)

An Overview of Convergence Rates for Sum of Squares Hierarchies in Polynomial Optimization
par: Laurent, Monique, et autres
Publié: (2024)

Smooth hyperbolicity cones are second-order cone representable
par: Scheiderer, Claus
Publié: (2025)

Exploiting Term Sparsity in Symmetry-Adapted Basis for Polynomial Optimization
par: Klep, Igor, et autres
Publié: (2025)

Sum-of-squares hierarchies for polynomial optimization and the Christoffel-Darboux kernel
par: Slot, Lucas
Publié: (2021)

Exploiting Sparsity in Complex Polynomial Optimization
par: Wang, Jie, et autres
Publié: (2021)

Sufficiently Regularized Nonnegative Quartic Polynomials are Sum-of-Squares
par: Zhu, Wenqi, et autres
Publié: (2026)

Improved effective Łojasiewicz inequality and applications
par: Basu, Saugata, et autres
Publié: (2022)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
par: Hou, Di, et autres
Publié: (2025)

Chambers and walls in spaces of real algebraic curves of small degrees
par: Zvonilov, Victor Ivanovich
Publié: (2025)

Non-Archimedean Calabi-Yau Potentials on Certain Affine Varieties
par: Wang, Ying
Publié: (2025)

3D genome reconstruction from partially phased Hi-C data
par: Cifuentes, Diego, et autres
Publié: (2023)

Exposed extreme rays of the SONC cone
par: Dressler, Mareike, et autres
Publié: (2025)

Graphs of trigonal curves and rigid isotopies of singular real algebraic curves of bidegree $(4,3)$ on a hyperboloid
par: Zvonilov, V. I.
Publié: (2024)

Bounds on the infimum of polynomials over a generic semi-algebraic set using asymptotic critical values
par: Hilany, Boulos El, et autres
Publié: (2024)

Interior-point algorithms with full Newton steps for nonsymmetric convex conic optimization
par: Papp, Dávid, et autres
Publié: (2025)

Weighted Geometric Mean, Minimum Mediated Set, and Optimal Simple Second-Order Cone Representation
par: Wang, Jie
Publié: (2022)

Gram-like matrix preserving extensions and completions of noncommutative polynomials
par: Mukherjee, Arijit, et autres
Publié: (2025)

Geometry and Optimization of Shallow Polynomial Networks
par: Arjevani, Yossi, et autres
Publié: (2025)

Finite Convergence of the Moment-SOS Hierarchy on the Product of Spheres
par: Halaseh, Sami, et autres
Publié: (2025)

Non-SOS Positivstellensätze for semi-algebraic sets defined by polynomial matrix inequalities
par: Guo, Feng
Publié: (2025)

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
par: Hua, Zheng, et autres
Publié: (2021)

The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty
par: Goerigk, Marc, et autres
Publié: (2026)

A Moment-SOS Hierarchy for Robust Polynomial Matrix Inequality Optimization with SOS-Convexity
par: Guo, Feng, et autres
Publié: (2023)

Convex Mixed-Integer Nonlinear Programs Derived from Generalized Disjunctive Programming using Cones
par: Neira, David E. Bernal, et autres
Publié: (2021)

Distance Optimization in the Grassmannian of Lines
par: Friedman, Hannah, et autres
Publié: (2026)

SDP Feasibility Problems and sos Representation Ranks for OT-FKM Type Isoparametric Polynomials
par: Ge, Jianquan, et autres
Publié: (2026)

Euclidean distance degree of complete intersections via Newton polytopes
par: Thang, Nguyen Tat, et autres
Publié: (2024)

Lagrange Multipliers, Duality, and Sensitivity in Set-Valued Convex Programming via Pointed Closed Convex Processes
par: García-Castaño, Fernando, et autres
Publié: (2024)

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
par: Kojima, Masakazu, et autres
Publié: (2025)

An efficient sum of squares nonnegativity certificate for quaternary quartic
par: Pasechnik, Dmitrii V.
Publié: (2015)

Sparse Polynomial Matrix Optimization
par: Miller, Jared, et autres
Publié: (2024)

Nonnegativity of signomials with Newton simplex over $\mathcal{A}$-convex sets
par: Averkov, Gennadiy, et autres
Publié: (2025)

The Effective Lasserre's Perturbative Positivstellensatz
par: Klep, Igor, et autres
Publié: (2026)

Sparse Polynomial Optimization with Unbounded Sets
par: Huang, Lei, et autres
Publié: (2024)