Image de couverture de livre

Splitting Proximal Point Algorithms for the Sum of Prox-Convex Functions

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	de Brito, Jose, Lara, Felipe, Van Thang, Tran
Format:	Preprint
Publié:	2026
Sujets:	Optimization and Control 90C26, 90C30
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Extending Linear Convergence of the Proximal Point Algorithm: The Quasar-Convex Case
par: de Brito, José, et autres
Publié: (2025)

Star Quasiconvexity: a Unified Approach for Linear Convergence of First-Order Methods Beyond Convexity
par: Khanh, Phan Quoc, et autres
Publié: (2025)

Characterizations of Strongly Quasiconvex Functions
par: Hadjisavvas, Nicolas, et autres
Publié: (2025)

Global Solutions to Non-Convex Functional Constrained Problems with Hidden Convexity
par: Fatkhullin, Ilyas, et autres
Publié: (2025)

A Fully Parameter-Free Second-Order Algorithm for Convex-Concave Minimax Problems
par: Wang, Junlin, et autres
Publié: (2024)

Hidden convexity of quadratic systems and its application to quadratic programming
par: Huy, Nguyen Quang, et autres
Publié: (2026)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
par: Takahashi, Shota, et autres
Publié: (2025)

Effective Front-Descent Algorithms with Convergence Guarantees
par: Lapucci, Matteo, et autres
Publié: (2024)

Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization
par: Higuchi, Rei, et autres
Publié: (2024)

A Surrogate Value Function Formulation for Bilevel Optimization
par: Xu, Mengwei, et autres
Publié: (2025)

On Tackling High-Dimensional Nonconvex Stochastic Optimization via Stochastic First-Order Methods with Non-smooth Proximal Terms and Variance Reduction
par: Xie, Yue, et autres
Publié: (2025)

Delayed Feedback in Online Non-Convex Optimization: A Non-Stationary Approach with Applications
par: Lara, Felipe, et autres
Publié: (2024)

Optimization Problems with Difference of Tangentially Convex Functions under Uncertainty
par: Mashkoorzadeh, Feryal, et autres
Publié: (2026)

Proximal Nonlinear Conjugate Gradient Methods for Composite Optimization
par: Hamana, Shodai, et autres
Publié: (2026)

A heavy-ball type curve search method for smooth convexly constrained optimization
par: Donnini, Federica, et autres
Publié: (2026)

A four-operator splitting algorithm for nonconvex and nonsmooth optimization
par: Alcantara, Jan Harold, et autres
Publié: (2024)

Norm-induced Cuts: Outer Approximation for Lipschitzian Constraint Functions
par: Göß, Adrian, et autres
Publié: (2024)

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
par: Li, Qia, et autres
Publié: (2024)

Derivative-Free Bilevel Optimization with Inexact Lower-Level Solutions
par: Cesaroni, Edoardo, et autres
Publié: (2026)

Optimization over convex polyhedra via Hadamard parametrizations
par: Tang, Tianyun, et autres
Publié: (2024)

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
par: Quintero, Rodolfo A., et autres
Publié: (2024)

Projection-based curve pattern search for black-box optimization over smooth convex sets
par: Jia, Xiaoxi, et autres
Publié: (2025)

Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
par: Lapucci, Matteo, et autres
Publié: (2024)

A Globally Convergent Gradient Method with Momentum
par: Lapucci, Matteo, et autres
Publié: (2024)

Penalty decomposition derivative free method for the minimization of partially separable functions over a convex feasible set
par: Cecere, Francesco, et autres
Publié: (2025)

Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
par: González-Díaz, Julio, et autres
Publié: (2025)

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
par: Ghaffari-Hadigheh, Alireza, et autres
Publié: (2022)

Splitting the Conditional Gradient Algorithm
par: Woodstock, Zev, et autres
Publié: (2023)

Stochastic First-Order Methods with Non-smooth and Non-Euclidean Proximal Terms for Nonconvex High-Dimensional Stochastic Optimization
par: Xie, Yue, et autres
Publié: (2024)

A Boosted-DCA with Power-Sum-DC Decomposition for Linearly Constrained Polynomial Programs
par: Zhang, Hu, et autres
Publié: (2022)

Non-Convex Self-Concordant Functions: Practical Algorithms and Complexity Analysis
par: Goldfarb, Donald, et autres
Publié: (2025)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
par: Xie, Xiyuan, et autres
Publié: (2025)

Barrier Algorithms for Constrained Non-Convex Optimization
par: Dvurechensky, Pavel, et autres
Publié: (2024)

Gradient Norm Regularization Second-Order Algorithms for Solving Nonconvex-Strongly Concave Minimax Problems
par: Wang, Jun-Lin, et autres
Publié: (2024)

Exploiting Sign Symmetries in Minimizing Sums of Rational Functions
par: Guo, Feng, et autres
Publié: (2024)

Clash of MINLP Relaxations: Piecewise Linear vs. Global Parabolic
par: Göß, Adrian
Publié: (2026)

Riemannian Gradient Method with Momentum
par: Leggio, Filippo, et autres
Publié: (2026)

Parabolic Approximation & Relaxation for MINLP
par: Göß, Adrian, et autres
Publié: (2024)

A Stochastic Quasi-Newton Method in the Absence of Common Random Numbers
par: Menickelly, Matt, et autres
Publié: (2023)

Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs
par: McRae, Andrew D., et autres
Publié: (2023)