Imagen de Portada

Proximal Nonlinear Conjugate Gradient Methods for Composite Optimization

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Hamana, Shodai, Narushima, Yasushi
Formato:	Preprint
Publicado:	2026
Materias:	Optimization and Control Numerical Analysis 90C30, 90C25, 90C26
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Riemannian Accelerated Proximal Gradient Method
por: Feng, Shuailing, et al.
Publicado: (2025)

A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach
por: Monteiro, Renato D. C., et al.
Publicado: (2024)

Regularized Barzilai-Borwein method
por: An, Congpei, et al.
Publicado: (2022)

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

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

AS-BOX: Additional Sampling Method for Weighted Sum Problems with Box Constraints
por: Krejić, Nataša, et al.
Publicado: (2025)

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

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

Riemannian Gradient Method with Momentum
por: Leggio, Filippo, et al.
Publicado: (2026)

Effects of Finite-Precision Arithmetic on Interior-Point Methods for Nonlinear Programming
por: Wright, Stephen J.
Publicado: (2001)

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

Dual Spectral Projected Gradient Method for Generalized Log-det Semidefinite Programming
por: Namchaisiri, Charles, et al.
Publicado: (2024)

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

Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
por: Bao, Chenglong, et al.
Publicado: (2024)

A Modified Proximal Bundle Method Under A Frank-Wolfe Perspective
por: Fersztand, David, et al.
Publicado: (2024)

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

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

A User Manual for cuHALLaR: A GPU Accelerated Low-Rank Semidefinite Programming Solver
por: Aguirre, Jacob, et al.
Publicado: (2025)

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

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

Interval-Valued Optimization Problems for Strongly LU-E-Invex and Strongly LU-E-Preinvex Functions
por: Tauheed, et al.
Publicado: (2026)

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

Nesterov's Accelerated Jacobi-Type Methods for Large-scale Symmetric Positive Semidefinite Linear Systems
por: Liang, Ling, et al.
Publicado: (2024)

Stochastic First-Order Methods with Non-smooth and Non-Euclidean Proximal Terms for Nonconvex High-Dimensional Stochastic Optimization
por: Xie, Yue, et al.
Publicado: (2024)

Optimal Subgradient Methods for Lipschitz Convex Optimization with Error Bounds
por: Wang, Alex L.
Publicado: (2025)

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

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

Complexity-optimal and parameter-free first-order methods for finding stationary points of composite optimization problems
por: Kong, Weiwei
Publicado: (2022)

A Trust Region Proximal Gradient Method for Nonlinear Multi-objective Optimization Problems
por: Ansary, Md Abu Talhamainuddin
Publicado: (2024)

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

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

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

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

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

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
por: Zhang, Liwei, et al.
Publicado: (2025)

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

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

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

A Proximal Stochastic Gradient Method with Adaptive Step Size and Variance Reduction for Convex Composite Optimization
por: Fang, Changjie, et al.
Publicado: (2025)

Parallelizing the Circumcentered-Reflection Method
por: Barros, Pablo, et al.
Publicado: (2025)