Imagen de Portada

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Niu, Yi-Shuai, Thi, Hoai An Le, Pham, Dinh Tao
Formato:	Preprint
Publicado:	2018
Materias:	Optimization and Control 12Y05, 65K05, 90C22, 90C25, 90C26, 90C30, 90C90
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
por: Takahashi, Shota, et al.
Publicado: (2025)

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
por: Brosch, Daniel, et al.
Publicado: (2025)

A Moment-SOS Hierarchy for Robust Polynomial Matrix Inequality Optimization with SOS-Convexity
por: Guo, Feng, et al.
Publicado: (2023)

A structured L-BFGS method and its application to inverse problems
por: Mannel, Florian, et al.
Publicado: (2023)

A structured L-BFGS method with diagonal scaling and its application to image registration
por: Mannel, Florian, et al.
Publicado: (2024)

The SCIP Optimization Suite 9.0
por: Bolusani, Suresh, et al.
Publicado: (2024)

The SCIP Optimization Suite 10.0
por: Hojny, Christopher, et al.
Publicado: (2025)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
por: Zhou, Juan, et al.
Publicado: (2024)

A Busemann hybrid projection-proximal point algorithm for optimization problems on Hadamard manifolds
por: Millán, R. Díaz, et al.
Publicado: (2026)

Performance Estimation for Smooth and Strongly Convex Sets
por: Luner, Alan, et al.
Publicado: (2024)

Difference of Convex (DC) approach for neural network approximation with uniform loss function
por: Peiris, Vinesha, et al.
Publicado: (2026)

Tight Error Bounds for the Sign-Constrained Stiefel Manifold
por: Chen, Xiaojun, et al.
Publicado: (2022)

Steering exact penalty DCA for nonsmooth DC optimization problems with equality and inequality constraints
por: Dolgopolik, M. V.
Publicado: (2021)

Randomized block proximal method with locally Lipschitz continuous gradient
por: Pérez-Aros, Pedro, et al.
Publicado: (2025)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
por: Kanzow, Christian, et al.
Publicado: (2025)

A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
por: Zhou, Junpeng, et al.
Publicado: (2025)

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
por: Mannel, Florian
Publicado: (2024)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
por: Deng, Kangkang, et al.
Publicado: (2024)

On the convergence of proximal gradient methods for convex simple bilevel optimization
por: Latafat, Puya, et al.
Publicado: (2023)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
por: Zhang, Chenyu, et al.
Publicado: (2023)

Extrapolated Plug-and-Play Three-Operator Splitting Methods for Nonconvex Optimization with Applications to Image Restoration
por: Wu, Zhongming, et al.
Publicado: (2024)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
por: Marumo, Naoki
Publicado: (2025)

A New Two-dimensional Model-based Subspace Method for Large-scale Unconstrained Derivative-free Optimization: 2D-MoSub
por: Xie, Pengcheng, et al.
Publicado: (2023)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
por: Xie, Xiyuan, et al.
Publicado: (2025)

Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
por: Marumo, Naoki, et al.
Publicado: (2023)

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
por: Li, Qia, et al.
Publicado: (2024)

Convergence-Guaranteed Algorithms for l1/2-Regularized Quadratic Programs with Assignment Constraints
por: Xie, Lijun, et al.
Publicado: (2025)

Local Convergence Analysis of ADMM for Nonconvex Composite Optimization
por: Xie, Xiyuan, et al.
Publicado: (2026)

A non-monotone trust-region method with noisy oracles and additional sampling
por: Krejic, Natasa, et al.
Publicado: (2023)

Optimality Conditions and Numerical Algorithms for a Class of Minimax Bilevel Optimization Problems
por: Hu, Yaling, et al.
Publicado: (2026)

The Global R-linear Convergence of Nesterov's Accelerated Gradient Method with Unknown Strongly Convex Parameter
por: Bao, Chenglong, et al.
Publicado: (2023)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
por: Deng, Kangkang, et al.
Publicado: (2025)

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
por: Song, Yongcun, et al.
Publicado: (2024)

Parallel block coordinate descent methods with identification strategies
por: Lopes, Ronaldo, et al.
Publicado: (2025)

cuHALLaR: A GPU Accelerated Low-Rank Augmented Lagrangian Method for Large-Scale Semidefinite Programming
por: Aguirre, Jacob M., et al.
Publicado: (2025)

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
por: He, Jiahuan, et al.
Publicado: (2023)

On Averaging and Extrapolation for Gradient Descent
por: Luner, Alan, et al.
Publicado: (2024)

Preconditioned Proximal Gradient Methods with Conjugate Momentum: A Subspace Perspective
por: Chen, Jian, et al.
Publicado: (2026)

Extragradient method with feasible inexact projection to variational inequality problem
por: Millán, R. Díaz, et al.
Publicado: (2023)

Delayed Feedback in Online Non-Convex Optimization: A Non-Stationary Approach with Applications
por: Lara, Felipe, et al.
Publicado: (2024)