Copertina

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Ghaffari-Hadigheh, Alireza, Sinjorgo, Lennart, Sotirov, Renata
Natura:	Preprint
Pubblicazione:	2022
Soggetti:	Optimization and Control 90C06, 90C30, 90C26
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

SDP bounds on the stability number via ADMM and intermediate levels of the Lasserre hierarchy
di: Sinjorgo, Lennart, et al.
Pubblicazione: (2025)

Stability and convergence analysis of AdaGrad for non-convex optimization via novel stopping time-based techniques
di: Jin, Ruinan, et al.
Pubblicazione: (2024)

New vector transport operators extending a Riemannian CG algorithm to generalized Stiefel manifold with low-rank applications
di: Wang, Xuejie, et al.
Pubblicazione: (2023)

On Tackling High-Dimensional Nonconvex Stochastic Optimization via Stochastic First-Order Methods with Non-smooth Proximal Terms and Variance Reduction
di: Xie, Yue, et al.
Pubblicazione: (2025)

PANOC-lite: A simpler and more efficient algorithm for composite minimization
di: Bodard, Alexander, et al.
Pubblicazione: (2026)

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

A KL-based Analysis Framework with Applications to Non-Descent Optimization Methods
di: Qiu, Junwen, et al.
Pubblicazione: (2024)

Beyond binarity: Semidefinite programming for ternary quadratic problems
di: de Meijer, Frank, et al.
Pubblicazione: (2026)

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

Nonsmooth exact penalty methods for equality-constrained optimization: complexity and implementation
di: Diouane, Youssef, et al.
Pubblicazione: (2024)

High Probability Guarantees for Random Reshuffling
di: Yu, Hengxu, et al.
Pubblicazione: (2023)

Alternating minimization for square root principal component pursuit
di: Deng, Shengxiang, et al.
Pubblicazione: (2024)

Stochastic First-Order Methods with Non-smooth and Non-Euclidean Proximal Terms for Nonconvex High-Dimensional Stochastic Optimization
di: Xie, Yue, 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)

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

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

Hidden convexity of quadratic systems and its application to quadratic programming
di: Huy, Nguyen Quang, et al.
Pubblicazione: (2026)

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

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

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

Level Constrained First Order Methods for Function Constrained Optimization
di: Boob, Digvijay, et al.
Pubblicazione: (2022)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
di: Takahashi, Shota, 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)

Asymptotic Convergence and Stability of Adaptive Gradient Methods in Smooth Non-convex Optimization
di: Jin, Ruinan, et al.
Pubblicazione: (2026)

A preconditioned augmented Lagrangian method for solving semidefinite programming problems
di: Tang, Tianyun, et al.
Pubblicazione: (2026)

Two trust region type algorithms for solving nonconvex-strongly concave minimax problems
di: Yao, Tongliang, et al.
Pubblicazione: (2024)

Forward-Backward algorithms for weakly convex problems
di: Bednarczuk, Ewa, et al.
Pubblicazione: (2023)

On a minimization problem of the maximum generalized eigenvalue: properties and algorithms
di: Nishioka, Akatsuki, et al.
Pubblicazione: (2023)

A new envelope function for nonsmooth DC optimization
di: Themelis, Andreas, et al.
Pubblicazione: (2020)

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

Decentralized projected Riemannian stochastic recursive momentum method for nonconvex optimization
di: Deng, Kangkang, et al.
Pubblicazione: (2024)

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

A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
di: Zhou, Junpeng, 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)

A Projection-Free Method for Solving Convex Bilevel Optimization Problems
di: Giang-Tran, Khanh-Hung, et al.
Pubblicazione: (2023)

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)

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)