Imagen de Portada

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

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Schlosser, Corbinian, Korda, Milan
Formato:	Preprint
Publicado:	2020
Materias:	Optimization and Control 90C22, 37M22
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Sparse Polynomial Matrix Optimization
por: Miller, Jared, et al.
Publicado: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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