Copertina

Strong Partitioning and a Machine Learning Approximation for Accelerating the Global Optimization of Nonconvex QCQPs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Kannan, Rohit, Nagarajan, Harsha, Deka, Deepjyoti
Natura:	Preprint
Pubblicazione:	2022
Soggetti:	Optimization and Control 90C26, 90C31, 65K05
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Bounding-Focused Discretization Methods for the Global Optimization of Nonconvex Semi-Infinite Programs
di: Turan, Evren M., et al.
Pubblicazione: (2023)

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

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

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

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

Boosted Stochastic Frank-Wolfe for Constrained Nonconvex Optimization
di: Nandhan, Navil, et al.
Pubblicazione: (2026)

Learning to Choose Branching Rules for Nonconvex MINLPs
di: Berthold, Timo, et al.
Pubblicazione: (2026)

A Globally Optimal Portfolio for m-Sparse Sharpe Ratio Maximization
di: Lin, Yizun, et al.
Pubblicazione: (2024)

MoSSP: A Momentum-Based Single-Loop Stochastic Penalty Method for Nonconvex Constrained DC-Regularized Optimization
di: Li, Luxuan, et al.
Pubblicazione: (2026)

Approximate Bregman Proximal Gradient Algorithm for Relatively Smooth Nonconvex Optimization
di: Takahashi, Shota, et al.
Pubblicazione: (2023)

An Algorithm to Solve Cardinality Constrained Quadratic Optimization Problem with an Application to the Best Subset Selection in Regression
di: Singh, Vikram, et al.
Pubblicazione: (2025)

A General Recipe for Parameter-Free Nonconvex Optimization via Higher-Order Regularization
di: Marumo, Naoki, et al.
Pubblicazione: (2026)

Heavy-ball Differential Equation Achieves $O(\varepsilon^{-7/4})$ Convergence for Nonconvex Functions
di: Okamura, Kaito, et al.
Pubblicazione: (2024)

Proximal Limited-Memory Quasi-Newton Methods for Nonsmooth Nonconvex Optimization
di: Dahl, Simeon vom, et al.
Pubblicazione: (2026)

An Algebraically Converging Stochastic Gradient Descent Algorithm for Global Optimization
di: Engquist, Björn, et al.
Pubblicazione: (2022)

Lipschitz continuity of solution multifunctions of extended $\ell_1$ regularization problems
di: Meng, Kaiwen, et al.
Pubblicazione: (2024)

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

On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models
di: Li, Wenjing, et al.
Pubblicazione: (2023)

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

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

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

On a globally convergent semismooth* Newton method in nonsmooth nonconvex optimization
di: Gfrerer, H.
Pubblicazione: (2024)

Globally Optimal Solutions to a Class of Fractional Optimization Problems Based on Proximal Gradient Algorithm
di: Lin, Yizun, et al.
Pubblicazione: (2023)

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

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

New finite relaxation hierarchies for concavo-convex, disjoint bilinear programs, and facial disjunctions
di: Tawarmalani, Mohit
Pubblicazione: (2024)

A stochastic use of the Kurdyka-Lojasiewicz property: Investigation of optimization algorithms behaviours in a non-convex differentiable framework
di: Fest, Jean-Baptiste, et al.
Pubblicazione: (2023)

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

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

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

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

Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization
di: Li, Hanyang, et al.
Pubblicazione: (2025)

An Extended ADMM for 3-Block Nonconvex Nonseparable Problems with Applications
di: Liu, Zekun
Pubblicazione: (2024)

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

Inexact Proximal Point Algorithms for Zeroth-Order Global Optimization
di: Zhang, Minxin, et al.
Pubblicazione: (2024)

Accelerated-gradient-based generalized Levenberg--Marquardt method with oracle complexity bound and local quadratic convergence
di: Marumo, Naoki, et al.
Pubblicazione: (2022)

A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions
di: Bao, Chenglong, et al.
Pubblicazione: (2025)

Global optimization of multivariable functions satisfying the Vanderbei condition
di: Arutyunova, Natalya, et al.
Pubblicazione: (2019)

Local Convergence of Adaptively Regularized Tensor Methods
di: Welzel, Karl, et al.
Pubblicazione: (2025)

Optimization in complex spaces with the Mixed Newton Method
di: Bakhurin, Sergey, et al.
Pubblicazione: (2022)