Copertina

Optimization in complex spaces with the Mixed Newton Method

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Bakhurin, Sergey, Hildebrand, Roland, Alkousa, Mohammad, Titov, Alexander, Yudin, Nikita
Natura:	Preprint
Pubblicazione:	2022
Soggetti:	Optimization and Control 32-08, 90C26, 65K05, 90C53
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Mixed Newton Method for Optimization in Complex Spaces
di: Yudin, Nikita, et al.
Pubblicazione: (2024)

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

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

A Globally Optimal Portfolio for m-Sparse Sharpe Ratio Maximization
di: Lin, Yizun, et al.
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)

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

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
di: Mannel, Florian
Pubblicazione: (2024)

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

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
di: Song, Yongcun, et al.
Pubblicazione: (2024)

A Unified Zeroth-Order Proximal Newton-Type Framework for Composite Optimization
di: Liu, Zekun, et al.
Pubblicazione: (2026)

A structured L-BFGS method and its application to inverse problems
di: Mannel, Florian, et al.
Pubblicazione: (2023)

A structured L-BFGS method with diagonal scaling and its application to image registration
di: Mannel, Florian, et al.
Pubblicazione: (2024)

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

A distributed Douglas-Rachford splitting method for solving linear constrained multi-block weakly convex problems
di: Hu, Leyu, et al.
Pubblicazione: (2024)

A linesearch-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization
di: Zeng, Hanfeng, et al.
Pubblicazione: (2026)

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

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

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

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

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

Bilevel Learning via Inexact Stochastic Gradient Descent
di: Salehi, Mohammad Sadegh, et al.
Pubblicazione: (2025)

Adaptive Inertial Method
di: Long, Han, et al.
Pubblicazione: (2025)

A Theory of the NEPv Approach for Optimization On the Stiefel Manifold
di: Li, Ren-Cang
Pubblicazione: (2023)

An efficient proximal algorithm for squared L1 over L2 regularized sparse recovery
di: Zhang, Na, et al.
Pubblicazione: (2025)

A Stochastic Quasi-Newton Method in the Absence of Common Random Numbers
di: Menickelly, Matt, et al.
Pubblicazione: (2023)

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

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
di: Zhang, Chenyu, et al.
Pubblicazione: (2023)

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

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

A preconditioned difference of convex functions algorithm with extrapolation and line search
di: Zhang, Ran, et al.
Pubblicazione: (2025)

Swarm-Based Inertial Methods for Optimization
di: Wu, Qiyu, et al.
Pubblicazione: (2026)

Greedy Learning to Optimize with Convergence Guarantees
di: Fahy, Patrick, et al.
Pubblicazione: (2024)

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

Projected gradient descent accumulates at Bouligand stationary points
di: Olikier, Guillaume, et al.
Pubblicazione: (2024)

Nonmonotone subgradient methods based on a local descent lemma
di: Aragón-Artacho, Francisco J., 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)

Strong Partitioning and a Machine Learning Approximation for Accelerating the Global Optimization of Nonconvex QCQPs
di: Kannan, Rohit, et al.
Pubblicazione: (2022)

A simple iterative algorithm for maxcut
di: Shao, Sihong, et al.
Pubblicazione: (2018)

Continuous iterative algorithms for anti-Cheeger cut
di: Shao, Sihong, et al.
Pubblicazione: (2021)

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)