:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Schlosser, Corbinian, Korda, Milan
Format:	Preprint
Published:	2020
Subjects:	Optimization and Control 90C22, 37M22
Online Access:	https://arxiv.org/abs/2012.05572
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Sparse Polynomial Matrix Optimization
by: Miller, Jared, et al.
Published: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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