Copertina

A Boosted-DCA with Power-Sum-DC Decomposition for Linearly Constrained Polynomial Programs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Zhang, Hu, Niu, Yi-Shuai
Natura:	Preprint
Pubblicazione:	2022
Soggetti:	Optimization and Control 90C26, 90C30, 91G10
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs
di: Niu, Yi-Shuai
Pubblicazione: (2026)

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

On the Computation of the Efficient Frontier in Advanced Sparse Portfolio Optimization
di: Annunziata, Arturo, et al.
Pubblicazione: (2025)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
di: Niu, Yi-Shuai, et al.
Pubblicazione: (2018)

The Maximum Clique Problem under Adversarial Uncertainty: a min-max approach
di: Bomze, Immanuel, et al.
Pubblicazione: (2026)

Yau's Affine-Normal Descent for Large-Scale Unrestricted Higher-Moment Portfolio Optimization
di: Wang, Ya-Juan, et al.
Pubblicazione: (2026)

Splitting Proximal Point Algorithms for the Sum of Prox-Convex Functions
di: de Brito, Jose, et al.
Pubblicazione: (2026)

Extending Linear Convergence of the Proximal Point Algorithm: The Quasar-Convex Case
di: de Brito, José, et al.
Pubblicazione: (2025)

Star Quasiconvexity: a Unified Approach for Linear Convergence of First-Order Methods Beyond Convexity
di: Khanh, Phan Quoc, et al.
Pubblicazione: (2025)

An efficient asymptotic DC method for sparse and low-rank matrix recovery
di: Ding, Mingcai, et al.
Pubblicazione: (2024)

DC Semidefinite Programming and Cone Constrained DC Optimization: Theory and Local Search Methods
di: Dolgopolik, M. V.
Pubblicazione: (2021)

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

A Framework for Eliminating Paradoxical Orders in European Day-Ahead Electricity Markets through Mixed-Integer Linear Programming Strong Duality
di: Wang, Zhen, et al.
Pubblicazione: (2026)

Range of optimal values in absolute value linear programming with interval data
di: Hladík, Milan
Pubblicazione: (2025)

Solving nonconvex optimization problems via a second order dynamical system with unbounded damping
di: László, Szilárd Csaba
Pubblicazione: (2025)

Binno: A 1st-order method for Bi-level Nonconvex Nonsmooth Optimization for Matrix Factorizations
di: Selicato, Laura, et al.
Pubblicazione: (2025)

Clash of MINLP Relaxations: Piecewise Linear vs. Global Parabolic
di: Göß, Adrian
Pubblicazione: (2026)

Barrier Algorithms for Constrained Non-Convex Optimization
di: Dvurechensky, Pavel, et al.
Pubblicazione: (2024)

General Revenue Adequacy Conditions for Energy Transport Networks
di: Misra, Sidhant, et al.
Pubblicazione: (2026)

Robust Utility Maximization with Intractable Claims under Distributional Ambiguity: A Random Distributionally Robust Optimization Approach
di: Guan, Guohui, et al.
Pubblicazione: (2025)

A four-operator splitting algorithm for nonconvex and nonsmooth optimization
di: Alcantara, Jan Harold, et al.
Pubblicazione: (2024)

A heavy-ball type curve search method for smooth convexly constrained optimization
di: Donnini, Federica, et al.
Pubblicazione: (2026)

Characterizations of Strongly Quasiconvex Functions
di: Hadjisavvas, Nicolas, et al.
Pubblicazione: (2025)

OPM, a collection of Optimization Problems in Matlab
di: Gratton, Serge, et al.
Pubblicazione: (2021)

Global Solutions to Non-Convex Functional Constrained Problems with Hidden Convexity
di: Fatkhullin, Ilyas, et al.
Pubblicazione: (2025)

Finding directional stationary points of DC programs
di: Thi, Hoai An Le, et al.
Pubblicazione: (2026)

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
di: Ghaffari-Hadigheh, Alireza, et al.
Pubblicazione: (2022)

Optimization over convex polyhedra via Hadamard parametrizations
di: Tang, Tianyun, et al.
Pubblicazione: (2024)

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
di: Quintero, Rodolfo A., et al.
Pubblicazione: (2024)

Effective Front-Descent Algorithms with Convergence Guarantees
di: Lapucci, Matteo, et al.
Pubblicazione: (2024)

Projection-based curve pattern search for black-box optimization over smooth convex sets
di: Jia, Xiaoxi, et al.
Pubblicazione: (2025)

Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
di: Lapucci, Matteo, et al.
Pubblicazione: (2024)

A Surrogate Value Function Formulation for Bilevel Optimization
di: Xu, Mengwei, et al.
Pubblicazione: (2025)

A Globally Convergent Gradient Method with Momentum
di: Lapucci, Matteo, et al.
Pubblicazione: (2024)

Derivative-Free Bilevel Optimization with Inexact Lower-Level Solutions
di: Cesaroni, Edoardo, et al.
Pubblicazione: (2026)

Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization
di: Higuchi, Rei, et al.
Pubblicazione: (2024)

Penalty decomposition derivative free method for the minimization of partially separable functions over a convex feasible set
di: Cecere, Francesco, et al.
Pubblicazione: (2025)

Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
di: González-Díaz, Julio, et al.
Pubblicazione: (2025)

Robust Optimal Portfolio in a Mixture Setting with Partial Ambiguity
di: Shyamalkumar, N. D., et al.
Pubblicazione: (2026)

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