Cover Image

Mixed Newton Method for Optimization in Complex Spaces

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Yudin, Nikita, Hildebrand, Roland, Bakhurin, Sergey, Degtyarev, Alexander, Lisachenko, Anna, Kuruzov, Ilya, Semenov, Andrei, Alkousa, Mohammad
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Machine Learning 32-08, 90C26, 65K05, 90C53
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimization in complex spaces with the Mixed Newton Method
by: Bakhurin, Sergey, et al.
Published: (2022)

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

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

Riemannian Gradient Method with Momentum
by: Leggio, Filippo, et al.
Published: (2026)

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

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

Closing the duality gap of the generalized trace ratio problem
by: Yang, Meijia, et al.
Published: (2024)

Optimality Conditions and Duality for Multiobjective Fractional Bilevel Optimization Problems
by: Lara, Felipe, et al.
Published: (2025)

On Optimality Conditions for Mathematical Programming Problems Based on Strong Subdifferentials
by: Lara, Felipe, et al.
Published: (2026)

New results on the local-nonglobal minimizers of the generalized trust-region subproblem
by: Ai, Wenbao, et al.
Published: (2024)

Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms
by: Bestuzheva, Ksenia, et al.
Published: (2022)

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

Douglas-Rachford splitting and ADMM for nonconvex optimization: Accelerated and Newton-type linesearch algorithms
by: Themelis, Andreas, et al.
Published: (2020)

Conductance Estimation in Digraphs: Submodular Transformation, Lovász Extension and Dinkelbach Iteration
by: Shao, Sihong, et al.
Published: (2025)

Alternating Iteratively Reweighted $\ell_1$ and Subspace Newton Algorithms for Nonconvex Sparse Optimization
by: Wang, Hao, et al.
Published: (2024)

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

A stochastic use of the Kurdyka-Lojasiewicz property: Investigation of optimization algorithms behaviours in a non-convex differentiable framework
by: Fest, Jean-Baptiste, et al.
Published: (2023)

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

SPIRAL: A superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization
by: Behmandpoor, Pourya, et al.
Published: (2022)

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

A Globally Optimal Portfolio for m-Sparse Sharpe Ratio Maximization
by: Lin, Yizun, et al.
Published: (2024)

Quasi-Newton methods for minimizing a quadratic function subject to uncertainty
by: Peng, Shen, et al.
Published: (2021)

Accelerating Deterministic Global Optimization via GPU-parallel Interval Arithmetic
by: Zhang, Hongzhen, et al.
Published: (2025)

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

Variational analysis of unbounded and discontinuous generalized eigenvalue functions with application to topology optimization
by: Nishioka, Akatsuki, et al.
Published: (2024)

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

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

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

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

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

Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity
by: Latafat, Puya, et al.
Published: (2021)

Approximate optimality conditions and sensitivity analysis in nearly convex optimization
by: Van Tuyen, Nguyen, et al.
Published: (2024)

A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
by: Ahookhosh, Masoud, et al.
Published: (2019)

Projected subgradient methods for paraconvex optimization: Application to robust low-rank matrix recovery
by: Rahimi, Morteza, et al.
Published: (2024)

(Adaptive) Scaled gradient methods beyond locally Holder smoothness: Lyapunov analysis, convergence rate and complexity
by: Ghaderi, Susan, et al.
Published: (2025)

Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
by: Latafat, Puya, et al.
Published: (2019)

Mixed-Integer Linear Optimization for Cardinality-Constrained Random Forests
by: Burgard, Jan Pablo, et al.
Published: (2024)

Mixed-Integer Linear Optimization for Semi-Supervised Optimal Classification Trees
by: Burgard, Jan Pablo, et al.
Published: (2024)

Fix-and-Propagate Heuristics Using Low-Precision First-Order LP Solutions for Large-Scale Mixed-Integer Linear Optimization
by: Kempke, Nils-Christian, et al.
Published: (2025)

Generalized Metric Subregularity with Applications to High-Order Regularized Newton Methods
by: Li, Guoyin, et al.
Published: (2024)