:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Slot, Lucas, Steurer, David, Wiedmer, Manuel
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Data Structures and Algorithms Computational Complexity Algebraic Geometry Optimization and Control 90C23, 90C25, 14P10 F.2.0; G.1.6
Accesso online:	https://arxiv.org/abs/2511.03440
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization based on push-forward measures
di: Slot, Lucas, et al.
Pubblicazione: (2024)

Degree bounds for Putinar's Positivstellensatz on the hypercube
di: Baldi, Lorenzo, et al.
Pubblicazione: (2023)

On the convergence of critical points on real algebraic sets and applications to optimization
di: Basu, Saugata, et al.
Pubblicazione: (2025)

Computational complexity of sum-of-squares bounds for copositive programs
di: Palomba, Marilena, et al.
Pubblicazione: (2025)

Disjunctive Sum of Squares
di: Ahmadi, Amir Ali, et al.
Pubblicazione: (2026)

On odd powers of nonnegative polynomials that are not sums of squares
di: Blekherman, Grigoriy, et al.
Pubblicazione: (2024)

Exploiting Term Sparsity in Symmetry-Adapted Basis for Polynomial Optimization
di: Klep, Igor, et al.
Pubblicazione: (2025)

Smooth hyperbolicity cones are second-order cone representable
di: Scheiderer, Claus
Pubblicazione: (2025)

An Overview of Convergence Rates for Sum of Squares Hierarchies in Polynomial Optimization
di: Laurent, Monique, et al.
Pubblicazione: (2024)

Sufficiently Regularized Nonnegative Quartic Polynomials are Sum-of-Squares
di: Zhu, Wenqi, et al.
Pubblicazione: (2026)

Improved effective Łojasiewicz inequality and applications
di: Basu, Saugata, et al.
Pubblicazione: (2022)

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

Non-Archimedean Calabi-Yau Potentials on Certain Affine Varieties
di: Wang, Ying
Pubblicazione: (2025)

3D genome reconstruction from partially phased Hi-C data
di: Cifuentes, Diego, et al.
Pubblicazione: (2023)

Exploiting Sparsity in Complex Polynomial Optimization
di: Wang, Jie, et al.
Pubblicazione: (2021)

Exposed extreme rays of the SONC cone
di: Dressler, Mareike, et al.
Pubblicazione: (2025)

Chambers and walls in spaces of real algebraic curves of small degrees
di: Zvonilov, Victor Ivanovich
Pubblicazione: (2025)

Bounds on the infimum of polynomials over a generic semi-algebraic set using asymptotic critical values
di: Hilany, Boulos El, et al.
Pubblicazione: (2024)

Gram-like matrix preserving extensions and completions of noncommutative polynomials
di: Mukherjee, Arijit, et al.
Pubblicazione: (2025)

Finite Convergence of the Moment-SOS Hierarchy on the Product of Spheres
di: Halaseh, Sami, et al.
Pubblicazione: (2025)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
di: Hou, Di, et al.
Pubblicazione: (2025)

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

Geometry and Optimization of Shallow Polynomial Networks
di: Arjevani, Yossi, et al.
Pubblicazione: (2025)

SDP Feasibility Problems and sos Representation Ranks for OT-FKM Type Isoparametric Polynomials
di: Ge, Jianquan, et al.
Pubblicazione: (2026)

Distance Optimization in the Grassmannian of Lines
di: Friedman, Hannah, et al.
Pubblicazione: (2026)

The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty
di: Goerigk, Marc, et al.
Pubblicazione: (2026)

Nonnegativity of signomials with Newton simplex over $\mathcal{A}$-convex sets
di: Averkov, Gennadiy, et al.
Pubblicazione: (2025)

The Effective Lasserre's Perturbative Positivstellensatz
di: Klep, Igor, et al.
Pubblicazione: (2026)

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

Interior-point algorithms with full Newton steps for nonsymmetric convex conic optimization
di: Papp, Dávid, et al.
Pubblicazione: (2025)

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

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
di: Hua, Zheng, et al.
Pubblicazione: (2021)

An efficient sum of squares nonnegativity certificate for quaternary quartic
di: Pasechnik, Dmitrii V.
Pubblicazione: (2015)

Convex Mixed-Integer Nonlinear Programs Derived from Generalized Disjunctive Programming using Cones
di: Neira, David E. Bernal, et al.
Pubblicazione: (2021)

Euclidean distance degree of complete intersections via Newton polytopes
di: Thang, Nguyen Tat, et al.
Pubblicazione: (2024)

An exponentially stable discrete-time primal-dual algorithm for distributed constrained optimization
di: Ren, Xiaoxing, et al.
Pubblicazione: (2025)

A Moment-SOS Hierarchy for Robust Polynomial Matrix Inequality Optimization with SOS-Convexity
di: Guo, Feng, et al.
Pubblicazione: (2023)

Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
di: Emmerich, Michael T. M.
Pubblicazione: (2026)

An Effective Positivstellensatz over the Rational Numbers for Finite Semialgebraic Sets
di: Baldi, Lorenzo, et al.
Pubblicazione: (2024)

Stiefel optimization is NP-hard
di: Lai, Zehua, et al.
Pubblicazione: (2025)