:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Hu, Xiaomeng, Nie, Jiawang, Zhong, Suhan
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2502.01075
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Distributionally Robust Optimization with Polynomial Robust Constraints
by: Nie, Jiawang, et al.
Published: (2023)

Towards Global Solutions for Nonconvex Two-Stage Stochastic Programs: A Polynomial Lower Approximation Approach
by: Zhong, Suhan, et al.
Published: (2023)

Partial Lagrange Multiplier Expressions and Disjunctive Decompositions for Bilevel Optimization
by: Nie, Jiawang, et al.
Published: (2023)

Polynomial Optimization Relaxations for Generalized Semi-Infinite Programs
by: Hu, Xiaomeng, et al.
Published: (2023)

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

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

Generalized Nash equilibrium problems with quasi-linear constraints
by: Choi, Jiyoung, et al.
Published: (2024)

Optimization over the weakly Pareto set and multi-task learning
by: Huang, Lei, et al.
Published: (2025)

Homogenization for polynomial optimization with unbounded sets
by: Huang, Lei, et al.
Published: (2021)

Moment Relaxations for Data-Driven Wasserstein Distributionally Robust Optimization
by: Zhang, Shixuan, et al.
Published: (2025)

Polynomial Optimization Over Unions of Sets
by: Nie, Jiawang, et al.
Published: (2024)

Finite convergence of the Moment-SOS hierarchy for polynomial matrix optimization
by: Huang, Lei, et al.
Published: (2024)

Exploiting the polyhedral geometry of stochastic linear bilevel programming
by: Muñoz, Gonzalo, et al.
Published: (2022)

Positivstellensätze and Moment problems with Universal Quantifiers
by: Hu, Xiaomeng, et al.
Published: (2024)

Learning Polynomial Activation Functions for Deep Neural Networks
by: Zhang, Linghao, et al.
Published: (2025)

Moment-SOS relaxations for moment and tensor recovery problems
by: Huang, Lei, et al.
Published: (2024)

Data-driven distributionally robust MPC for systems with multiplicative noise: A semi-infinite semi-definite programming approach
by: Das, Souvik, et al.
Published: (2024)

The natural ordering cone of a polyhedral convex set-valued objective mapping
by: Löhne, Andreas
Published: (2023)

A Characterization for Tightness of the Sparse Moment-SOS Hierarchy
by: Nie, Jiawang, et al.
Published: (2024)

A Tight SDP Relaxation for the Cubic-Quartic Regularization Problem
by: Zhou, Jinling, et al.
Published: (2025)

Finite convergence of Moment-SOS relaxations with non-real radical ideals
by: Huang, Lei, et al.
Published: (2023)

Robust approximation of chance constrained optimization with polynomial perturbation
by: Rao, Bo, et al.
Published: (2022)

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

Sparse Polynomial Optimization with Matrix Constraints
by: Nie, Jiawang, et al.
Published: (2024)

A vector linear programming approach for certain global optimization problems
by: Ciripoi, Daniel, et al.
Published: (2017)

Rank One Completion for Higher Order Tensors
by: Zhang, Linghao, et al.
Published: (2026)

On incremental and semi-global exponential stability of gradient flows satisfying generalized Łojasiewicz inequalities
by: Oliveira, Andreas, et al.
Published: (2026)

The Rank-1 Completion Problem for Cubic Tensors
by: Zhou, Jinling, et al.
Published: (2024)

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

Nonsmooth Newton methods with effective subspaces for polyhedral regularization
by: Nghia, Tran T. A., et al.
Published: (2025)

Convex semi-infinite programming algorithms with inexact separation oracles
by: Oustry, Antoine, et al.
Published: (2023)

The Güntürk-Thao theorem revisited: polyhedral cones and limiting examples
by: Bauschke, Heinz H., et al.
Published: (2026)

Duality between polyhedral approximation of value functions and optimal quantization of measures
by: Mehamdi, Abdellah Bulaich, et al.
Published: (2025)

On the feasibility of generalized inverse linear programs
by: Buchheim, Christoph, et al.
Published: (2025)

Existence of solutions for polyhedral convex set optimization problems
by: Löhne, Andreas
Published: (2023)

A graphical framework for global optimization of mixed-integer nonlinear programs
by: Davarnia, Danial, et al.
Published: (2024)

Set-based state estimation of nonlinear discrete-time systems using constrained zonotopes and polyhedral relaxations
by: Rego, Brenner S., et al.
Published: (2025)

A solution method for arbitrary polyhedral convex set optimization problems
by: Löhne, Andreas
Published: (2023)

A combinatorial approach to Ramana's exact dual for semidefinite programming
by: Pataki, Gabor
Published: (2025)

A semi-smooth Newton method for the nonlinear conic problem with generalized simplicial cones
by: Armijo, Nicolas F., et al.
Published: (2026)