Copertina

Sparse decompositions of nonlinear dynamical systems and applications to moment-sum-of-squares relaxations

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Schlosser, Corbinian, Korda, Milan
Natura:	Preprint
Pubblicazione:	2020
Soggetti:	Optimization and Control 90C22, 37M22
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Robust upper estimates for topological entropy via nonlinear constrained optimization over adapted metrics
di: Anikushin, Mikhail, et al.
Pubblicazione: (2025)

Duality attainment and strict feasibility of the generalized moment problem and its relaxations
di: Halaseh, Sami, et al.
Pubblicazione: (2026)

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

Sparse convex relaxations in polynomial optimization
di: Averkov, Gennadiy, et al.
Pubblicazione: (2024)

On exactness of SDP relaxation for the maximum cut problem
di: Bhardwaj, Avinash, et al.
Pubblicazione: (2025)

A squared smoothing Newton method for semidefinite programming
di: Liang, Ling, et al.
Pubblicazione: (2023)

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
di: Marumo, Hiroki, et al.
Pubblicazione: (2024)

Convex relaxation approaches for high-dimensional optimal transport
di: Khoo, Yuehaw, et al.
Pubblicazione: (2025)

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

Convergence rate for linear minimizer-estimators in the moment-sum-of-squares hierarchy
di: Schlosser, Corbinian
Pubblicazione: (2025)

Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization
di: Bomze, Immanuel, et al.
Pubblicazione: (2024)

Sum-of-squares certificates for symmetric polynomials on the hypercube: a counterexample to a conjecture of De Klerk and Laurent
di: Polak, Sven
Pubblicazione: (2026)

A low-rank augmented Lagrangian method for doubly nonnegative relaxations of mixed-binary quadratic programs
di: Hou, Di, et al.
Pubblicazione: (2025)

Spurious local minima in nonconvex sum-of-squares optimization
di: Blekherman, Grigoriy, et al.
Pubblicazione: (2024)

Second-order sequential optimality conditions for nonlinear semidefinite optimization problems
di: Li, Huimin, et al.
Pubblicazione: (2025)

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

A polynomial projective algorithm for convex feasibility problems with positive-definite constraints
di: Chubanov, Sergei
Pubblicazione: (2025)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
di: Arima, Naohiko, et al.
Pubblicazione: (2024)

Sparse Polynomial Matrix Optimization
di: Miller, Jared, et al.
Pubblicazione: (2024)

A Newton Augmented Lagrangian Method for Symmetric Cone Programming with Complexity Analysis
di: Zhang, Rui-Jin, et al.
Pubblicazione: (2025)

Sparse Polynomial Optimization with Unbounded Sets
di: Huang, Lei, et al.
Pubblicazione: (2024)

SDP bounds on the stability number via ADMM and intermediate levels of the Lasserre hierarchy
di: Sinjorgo, Lennart, et al.
Pubblicazione: (2025)

A more efficient reformulation of complex SDP as real SDP
di: Wang, Jie
Pubblicazione: (2023)

Superlinear Convergence of an Interior Point Algorithm on Linear Semi-definite Feasibility Problems
di: Sim, Chee-Khian
Pubblicazione: (2022)

DC Semidefinite Programming and Cone Constrained DC Optimization: Theory and Local Search Methods
di: Dolgopolik, M. V.
Pubblicazione: (2021)

The link between $1$-norm approximation and effective Positivstellensatze for the hypercube
di: de Klerk, Etienne, et al.
Pubblicazione: (2024)

Practical Experience with Stable Set and Coloring Relaxations
di: Pucher, Dunja, et al.
Pubblicazione: (2024)

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

A Moment-QSOS Hierarchy for a Class of Quaternion Polynomial Optimization Problems
di: Liu, Yanqing, et al.
Pubblicazione: (2026)

Piecewise SOS-Convex Moment Optimization and Applications via Exact Semi-Definite Programs
di: Huang, Queenie Yingkun, et al.
Pubblicazione: (2024)

A conditional gradient homotopy method with applications to Semidefinite Programming
di: Dvurechensky, Pavel, et al.
Pubblicazione: (2022)

An efficient proximal algorithm for squared L1 over L2 regularized sparse recovery
di: Zhang, Na, et al.
Pubblicazione: (2025)

Connections between Bressan's Mixing Conjecture, the Branched Optimal Transport and Combinatorial Optimization
di: Zhou, Bohan
Pubblicazione: (2024)

A constraint-based approach to function interpolation, with application to performance estimation for weakly convex optimisation
di: Rubbens, Anne, et al.
Pubblicazione: (2024)

Extensions of $\mathcal{KL}$ and Lyapunov Functions for Discrete-time Dynamical System Peaks Analysis
di: Adjé, Assalé
Pubblicazione: (2024)

Energy matching in reduced passive and port-Hamiltonian systems
di: Holicki, Tobias, et al.
Pubblicazione: (2023)

A globally convergent SQP-type method with least constraint violation for nonlinear semidefinite programming
di: Fu, Wenhao, et al.
Pubblicazione: (2023)

Spectral Outer-Approximation Algorithms for Binary Semidefinite Problems
di: de Roux, Daniel, et al.
Pubblicazione: (2025)

Tight Semidefinite Relaxations for Verifying Robustness of Neural Networks
di: Azuma, Godai, et al.
Pubblicazione: (2025)

Dual certificates of primal cone membership
di: Lee, Joonyeob, et al.
Pubblicazione: (2025)