Copertina

An Inexact Proximal Newton Method for Nonconvex Composite Minimization

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Zhu, Hong
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control 90C26 49M15 65K05
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A Stochastic Block-coordinate Proximal Newton Method for Nonconvex Composite Minimization
di: Zhu, Hong, et al.
Pubblicazione: (2024)

An Inexact Regularized Proximal Newton Method without Line Search
di: Dahl, Simeon vom, et al.
Pubblicazione: (2024)

Practical Regularized Quasi-Newton Methods with Inexact Function Values
di: Hamaguchi, Hiroki, et al.
Pubblicazione: (2026)

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

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

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

Bregman Proximal Linearized ADMM for Minimizing Separable Sums Coupled by a Difference of Functions
di: Pham, Tan Nhat, et al.
Pubblicazione: (2024)

A Cubic Regularization Method for Multiobjective Optimization
di: Gonçalves, Douglas S., et al.
Pubblicazione: (2025)

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

A smoothed proximal trust-region algorithm for nonconvex optimization problems with $L^p$-regularization, $p\in (0,1)$
di: Antil, Harbir, et al.
Pubblicazione: (2025)

Non-Convex Self-Concordant Functions: Practical Algorithms and Complexity Analysis
di: Goldfarb, Donald, et al.
Pubblicazione: (2025)

Alternating Gradient-Type Algorithm for Bilevel Optimization with Inexact Lower-Level Solutions via Moreau Envelope-based Reformulation
di: Bai, Xiaoning, et al.
Pubblicazione: (2024)

Cyclic Relaxed Douglas-Rachford Splitting for Inconsistent Nonconvex Feasibility
di: Dinh, Thi Lan, et al.
Pubblicazione: (2025)

Inexact Limited Memory Bundle Method
di: Lampainen, Jenni, et al.
Pubblicazione: (2026)

A Unified Analysis on the Subgradient Upper Bounds for the Subgradient Methods Minimizing Composite Nonconvex, Nonsmooth and Non-Lipschitz Functions
di: Zhu, Daoli, et al.
Pubblicazione: (2023)

A Globally Convergent Third-Order Newton Method via Unified Semidefinite Programming Subproblems
di: Cai, Yubo, et al.
Pubblicazione: (2026)

QPALM: A Proximal Augmented Lagrangian Method for Nonconvex Quadratic Programs
di: Hermans, Ben, et al.
Pubblicazione: (2020)

A Single-loop Proximal Subgradient Algorithm for A Class Structured Fractional Programs
di: Han, Deren, et al.
Pubblicazione: (2025)

Composite Optimization with Indicator Functions: Stationary Duality and a Semismooth Newton Method
di: Zhang, Penghe, et al.
Pubblicazione: (2025)

GLL-type Nonmonotone Descent Methods Revisited under Kurdyka-Łojasiewicz Property
di: Qian, Yitian, et al.
Pubblicazione: (2025)

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

First- and Second-Order Stochastic Adaptive Regularization with Cubics: High Probability Iteration and Sample Complexity
di: Scheinberg, Katya, et al.
Pubblicazione: (2023)

An Inexact Boosted Difference of Convex Algorithm for Nondifferentiable Functions
di: Ferreira, Orizon P., et al.
Pubblicazione: (2024)

Quasar-Convex Optimization: Fundamental Properties and High-Order Proximal-Point Methods
di: Ahookhosh, Masoud, et al.
Pubblicazione: (2026)

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

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

A proximal splitting algorithm for generalized DC programming with applications in signal recovery
di: Pham, Tan Nhat, et al.
Pubblicazione: (2024)

Convergence of ZH-type nonmonotone descent method for Kurdyka-Łojasiewicz optimization problems
di: Qian, Yitian, et al.
Pubblicazione: (2024)

A full splitting algorithm for structured difference-of-convex programs
di: Bot, Radu Ioan, et al.
Pubblicazione: (2025)

A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems
di: Pham, Tan Nhat, et al.
Pubblicazione: (2022)

Convergence of the Preconditioned Proximal Point Method and Douglas-Rachford Splitting in the Absence of Monotonicity
di: Evens, Brecht, et al.
Pubblicazione: (2023)

Adaptive Multilevel Newton: A Quadratically Convergent Optimization Method
di: Tsipinakis, Nick, et al.
Pubblicazione: (2025)

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

Riemannian Trust Region Methods for SC$^1$ Minimization
di: Zhang, Chenyu, et al.
Pubblicazione: (2023)

ProxSTORM -- A Stochastic Trust-Region Algorithm for Nonsmooth Optimization
di: Baraldi, Robert J., et al.
Pubblicazione: (2025)

A Sequential Homotopy Method for Mathematical Programming Problems
di: Potschka, Andreas, et al.
Pubblicazione: (2019)

Flexible block-iterative analysis for the Frank-Wolfe algorithm
di: Braun, Gábor, et al.
Pubblicazione: (2024)

A full splitting algorithm for fractional programs with structured numerators and denominators
di: Boţ, Radu Ioan, et al.
Pubblicazione: (2023)

Minimization Over the Nonconvex Sparsity Constraint Using A Hybrid First-order method
di: Yang, Xiangyu, et al.
Pubblicazione: (2021)

The Intrinsic Riemannian Proximal Gradient Method for Nonconvex Optimization
di: Bergmann, Ronny, et al.
Pubblicazione: (2025)