:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Huang, Lei, Nie, Jiawang, Yuan, Ya-Xiang
Format:	Preprint
Published:	2021
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2112.15289
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

A global approach for generalized semi-infinte programs with polyhedral parameter sets
by: Hu, Xiaomeng, et al.
Published: (2025)

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

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

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

Convergence rates for polynomial optimization on set products
by: Magron, Victor
Published: (2025)

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

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

Approximations of unbounded convex projections and unbounded convex sets
by: Kováčová, Gabriela, et al.
Published: (2023)

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

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

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

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

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)

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

Solving unbounded optimal control problems with the moment-SOS hierarchy *
by: Sehnalová, Karolına, et al.
Published: (2025)

On the convergence of conditional gradient method for unbounded multiobjective optimization problems
by: Chen, Wang, et al.
Published: (2024)

Exact penalty functions in optimization with unbounded constraint sets
by: Jiao, Liguo, et al.
Published: (2025)

Dealing with unbounded gradients in stochastic saddle-point optimization
by: Neu, Gergely, et al.
Published: (2024)

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

Pontryagin-type maximum principle for a controlled sweeping process with nonsmooth and unbounded sweeping set
by: Nour, Chadi, et al.
Published: (2023)

Subdifferentially polynomially bounded functions and Gaussian smoothing-based zeroth-order optimization
by: Lei, Ming, et al.
Published: (2024)

Extremality of families of sets and set-valued optimization
by: Cuong, Nguyen Duy, et al.
Published: (2024)

Alternating direction method of multipliers for polynomial optimization
by: Cerone, V., et al.
Published: (2025)

Global optimization of low-rank polynomials
by: Gaggioli, Llorenç Balada, et al.
Published: (2025)

Composition and tensor train structure in polynomial optimization
by: Gaggioli, Llorenç Balada, et al.
Published: (2026)

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

Degree reduction techniques for polynomial optimization problems
by: González-Rodríguez, Brais, et al.
Published: (2024)

A polynomial-time solvable class of sparse box-constrained polynomial optimization problems
by: Khajavirad, Aida
Published: (2026)

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

Solving moment and polynomial optimization problems on Sobolev spaces
by: Henrion, Didier, et al.
Published: (2024)

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

Global weight optimization of frame structures with polynomial programming
by: Tyburec, Marek, et al.
Published: (2022)

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

Term-sparse polynomial optimization for the design of frame structures
by: Handa, Marouan, et al.
Published: (2025)