Cover Image

Almost Bijective Parametrization of Copositive Univariate Polynomials

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hong, Hoon, Nance, Ezra
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Almost Bijective Parametrization of $3 \times 3$ Copositive Matrices
by: Hong, Hoon, et al.
Published: (2024)

Sparse Copositive Polynomial Optimization
by: Zhong, Suhan, et al.
Published: (2026)

Funnel Synthesis via LMI Copositivity Conditions for Nonlinear Systems
by: Kim, Taewan, et al.
Published: (2024)

Pricing Electric Vehicle Charging and Station Access via Copositive Duality
by: Jiang, Nanfei, et al.
Published: (2026)

Polynomial Parametric Koopman Operators for Stochastic MPC
by: Iliakis, Efstathios, et al.
Published: (2026)

Sum-of-Squares Certificates for Almost-Sure Reachability of Stochastic Polynomial Systems
by: Kordabad, Arash Bahari, et al.
Published: (2025)

S-SOS: Stochastic Sum-Of-Squares for Parametric Polynomial Optimization
by: Zhu, Richard L., et al.
Published: (2024)

$L_{2+}$ Induced Norm Analysis of Continuous-Time LTI Systems Using Positive Filters and Copositive Programming
by: Ebihara, Yoshio, et al.
Published: (2024)

Copositive geometry of Feynman integrals
by: Sturmfels, Bernd, et al.
Published: (2025)

Univariate representations of solutions to generic polynomial complementarity problems
by: Hieu, Vu Trung, et al.
Published: (2024)

A Polynomial-Time Inner Approximation Algorithm for Multi-Objective and Parametric Optimization
by: Nemesch, Levin, et al.
Published: (2025)

A Copositive Framework for Analysis of Hybrid Ising-Classical Algorithms
by: Brown, Robin, et al.
Published: (2022)

Strict Copositivity for a Class of 3rd Order Symmetric Tensors
by: Li, Min, et al.
Published: (2024)

Copositive Matrices with Ordered Off-Diagonal Entries
by: Blekherman, Grigoriy, et al.
Published: (2026)

Completely Positive Reformulations of Polynomial Optimization Problems with Linear Inequality Constraints
by: Chen, Haibin, et al.
Published: (2026)

An Almost Feasible Sequential Linear Programming Algorithm
by: Kiessling, David, et al.
Published: (2024)

Perfect Copositive Matrices
by: Dannenberg, Valentin, et al.
Published: (2023)

Computing Solutions to the Polynomial-Polynomial Regulator Problem
by: Corbin, Nicholas A., et al.
Published: (2024)

Almost sure convergence of stochastic Hamiltonian descent methods
by: Williamson, Måns, et al.
Published: (2024)

Fast Consensus over Almost Regular Directed Graphs
by: Lu, Susie, et al.
Published: (2025)

On the Almost Sure Convergence of the Stochastic Three Points Algorithm
by: Kadi, Taha El Bakkali El, et al.
Published: (2025)

Objective Coefficient Rounding and Almost Symmetries in Binary Programs
by: Kuzinowicz, Dominik, et al.
Published: (2025)

Copositivity, discriminants and nonseparable signed supports
by: Feliu, Elisenda, et al.
Published: (2025)

Regret Analysis with Almost Sure Convergence for OBF-ARX Filter
by: Li, Jiayun, et al.
Published: (2024)

Learning Parametric Convex Functions
by: Schaller, Maximilian, et al.
Published: (2025)

Parametric Biobjective Linear Programming
by: Yuden, Kezang, et al.
Published: (2026)

Log-Polynomial Optimization
by: Choi, Jiyoung, et al.
Published: (2026)

Almost-Surely Convergent Randomly Activated Monotone Operator Splitting Methods
by: Combettes, Patrick L., et al.
Published: (2024)

Estimating Computational Noise on Parametric Curves
by: Menickelly, Matt
Published: (2024)

PDPO: Parametric Density Path Optimization
by: Hernandez, Sebastian Gutierrez, et al.
Published: (2025)

On Composable and Parametric Uncertainty in Systems Co-Design
by: Huang, Yujun, et al.
Published: (2025)

Generalized Smooth Stochastic Variational Inequalities: Almost Sure Convergence and Convergence Rates
by: Vankov, Daniil, et al.
Published: (2024)

Solving Convex Smooth Function Constrained Optimization Is Almost As Easy As Unconstrained Optimization
by: Zhang, Zhe, et al.
Published: (2022)

Robust Analysis of Almost Sure Convergence of Zeroth-Order Mirror Descent Algorithm
by: Paul, Anik Kumar, et al.
Published: (2023)

Spectral Methods for Polynomial Optimization
by: Moreno, Elvira, et al.
Published: (2025)

Harmonic Hierarchies for Polynomial Optimization
by: Cristancho, Sergio, et al.
Published: (2022)

Almost Surely $\sqrt{T}$ Regret for Adaptive LQR
by: Lu, Yiwen, et al.
Published: (2023)

Parametric Semidefinite Programming: Geometry of the Trajectory of Solutions
by: Bellon, Antonio, et al.
Published: (2021)

Almost Sure Convergence and Non-asymptotic Concentration Bounds for Stochastic Mirror Descent Algorithm
by: Paul, Anik Kumar, et al.
Published: (2024)

Parametric Reachable Sets Via Controlled Dynamical Embeddings
by: Harapanahalli, Akash, et al.
Published: (2025)