Cover Image

First-order SDSOS-convex semi-algebraic optimization and exact SOCP relaxations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Yang, Chengmiao, Jiao, Liguo, Lee, Jae Hyoung
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Charnes--Cooper transformation and fractional optimization with SOS-convex polynomials
by: Yang, Chengmiao, et al.
Published: (2025)

A parameter-free approach for solving SOS-convex semi-algebraic fractional programs
by: Yang, Chengmiao, et al.
Published: (2024)

SPLD polynomial optimization and bounded degree SOS hierarchies
by: Jiao, Liguo, et al.
Published: (2025)

Rank conditions for exactness of semidefinite relaxations in polynomial optimization
by: Lasserre, Jean B
Published: (2025)

Geometry of exactness of moment-SOS relaxations for polynomial optimization
by: Henrion, Didier
Published: (2023)

First-order algorithms for robust optimization problems via convex-concave saddle-point Lagrangian reformulation
by: Postek, Krzysztof, et al.
Published: (2021)

Exploiting higher-order derivatives in convex optimization methods
by: Kamzolov, Dmitry, et al.
Published: (2022)

A hierarchy of convex relaxations for the total variation distance
by: Lasserre, Jean-Bernard
Published: (2024)

An optimal first-order method for smooth and strongly convex composite optimization and its stationary limit
by: Upadhyaya, Manu, et al.
Published: (2026)

Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant
by: Mai, Ngoc Hoang Anh, et al.
Published: (2022)

First-order methods for stochastic and finite-sum convex optimization with deterministic constraints
by: Lu, Zhaosong, et al.
Published: (2025)

Globally Coupled Particle Swarm Optimization
by: Yuan, Liguo
Published: (2025)

An accelerated proximal bundle method for convex optimization
by: Liao, Feng-Yi, et al.
Published: (2025)

On the strength of Burer's lifted convex relaxation to quadratic programming with ball constraints
by: Kılınç-Karzan, Fatma, et al.
Published: (2024)

Achieving distributed convex optimization within prescribed time for high-order nonlinear multiagent systems
by: Zuo, Gewei, et al.
Published: (2024)

Approximate optimality conditions and sensitivity analysis in nearly convex optimization
by: Van Tuyen, Nguyen, et al.
Published: (2024)

Hypodifferentials of nonsmooth convex functions and their applications to nonsmooth convex optimization
by: Dolgopolik, M. V.
Published: (2023)

A systematic approach to general higher-order majorization-minimization algorithms for (non)convex optimization
by: Necoara, Ion, et al.
Published: (2020)

GeNIOS: an (almost) second-order operator-splitting solver for large-scale convex optimization
by: Diamandis, Theo, et al.
Published: (2023)

Numerical analysis of the convex relaxation of the barrier parameter functional of self-concordant barriers
by: Pirau, Vitali, et al.
Published: (2025)

Semidefinite relaxations for nonlinear elasticity with energies convex in the Cauchy-Green strain tensor
by: Henrion, Didier, et al.
Published: (2026)

An over-relaxed ADMM for separable convex programming and its applications to statistical learning
by: Ni, Renyuan
Published: (2024)

Lower Complexity Bounds of First-order Methods for Affinely Constrained Composite Non-convex Problems
by: Liu, Wei, et al.
Published: (2025)

A novel exact approach to polynomial optimization
by: Bertsimas, Dimitris, et al.
Published: (2025)

Scholtes relaxation method for pessimistic bilevel optimization
by: Benchouk, Imane, et al.
Published: (2021)

Strong duality in infinite convex optimization
by: Hantoute, Abderrahim, et al.
Published: (2025)

An adaptive linearized alternating direction multiplier method with a relaxation step for convex programming
by: Wang, Boran
Published: (2024)

An SDE perspective on stochastic convex optimization
by: Maulen-Soto, Rodrigo, et al.
Published: (2022)

On moment relaxations for linear state feedback controller synthesis with non-convex quadratic costs and constraints
by: Gramlich, Dennis, et al.
Published: (2024)

Instance-specific linear relaxations of semidefinite optimization problems
by: de Roux, Daniel, et al.
Published: (2023)

First-order equivalent static loads for dynamic response structural optimization
by: Buzaglo, Mordechay, et al.
Published: (2025)

Classical solution to second-order Hamilton-Jacobi-Bellman equation and optimal feedback control for linear-convex problem
by: Li, Jinghua, et al.
Published: (2025)

Tightening convex relaxations of trained neural networks: a unified approach for convex and S-shaped activations
by: Carrasco, Pablo, et al.
Published: (2024)

First-order optimality conditions for non-commutative optimization problems
by: Araújo, Mateus, et al.
Published: (2023)

Research on the descent direction of prediction correction algorithms for pseudo-convex/convex optimization problems
by: Li, Ting, et al.
Published: (2025)

Universal subgradient and proximal bundle methods for convex and strongly convex hybrid composite optimization
by: Guigues, Vincent, et al.
Published: (2024)

Randomized gradient-free methods in convex optimization
by: Gasnikov, Alexander, et al.
Published: (2022)

Computing AD-compatible subgradients of convex relaxations of implicit functions
by: Song, Yingkai, et al.
Published: (2025)

Lagrange multiplier expressions for matrix polynomial optimization and tight relaxations
by: Huang, Lei, et al.
Published: (2025)

Existence and relaxation for optimal control governed by steady, quasilinear PDEs
by: Pedregal, Pablo
Published: (2024)