A search-free $O(1/k^{3/2})$ homotopy inexact proximal-Newton extragradient algorithm for monotone variational inequalities

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Alves, M. Marques, Pereira, João M., Svaiter, Benar F.
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control 49M15, 90C06, 68Q25, 47N10
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An inertial iteratively regularized extragradient method for bilevel variational inequality problems
by: Alves, M. Marques, et al.
Published: (2025)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
by: Bot, Radu Ioan, et al.
Published: (2024)

On the resolution of $\ell_1$-norm minimization via a two-metric adaptive projection method
by: Wu, Hanju, et al.
Published: (2025)

Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph
by: Chiarelli, Nina, et al.
Published: (2023)

Temporally Flexible Transport Scheduling on Networks with Departure-Arrival Constriction and Nodal Capacity Limits
by: Dong, Anqi, et al.
Published: (2026)

Accelerating preconditioned ADMM via degenerate proximal point mappings
by: Sun, Defeng, et al.
Published: (2024)

Variational models of robust optimal transport
by: De Masi, Luigi, et al.
Published: (2025)

On degenerate preconditioned proximal point methods under restricted monotonicity
by: Xue, Feng, et al.
Published: (2024)

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
by: Nesterov, Yurii
Published: (2025)

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

A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
by: He, Chuan, et al.
Published: (2023)

An Efficient Augmented Lagrangian Method for Dynamic Optimal Transport on Surfaces Based on Second-Order Cone Programming
by: Chen, Liang, et al.
Published: (2025)

A semiconcavity approach to stability of entropic plans and exponential convergence of Sinkhorn's algorithm
by: Chiarini, Alberto, et al.
Published: (2024)

A Theory of Composition and Duality of Extremal Optimal Fixed-Point Algorithms
by: Yoon, TaeHo, et al.
Published: (2026)

Generative Modeling by Minimizing the Wasserstein-2 Loss
by: Huang, Yu-Jui, et al.
Published: (2024)

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

Self-concordant smoothing in proximal quasi-Newton algorithms for large-scale convex composite optimization
by: Adeoye, Adeyemi D., et al.
Published: (2023)

A constraint-based approach to function interpolation, with application to performance estimation for weakly convex optimisation
by: Rubbens, Anne, et al.
Published: (2024)

Level proximal subdifferential, variational convexity, and pointwise quadratic approximation
by: Luo, Honglin, et al.
Published: (2024)

On the power of linear programming for K-means clustering
by: De Rosa, Antonio, et al.
Published: (2024)

Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems
by: Bousselmi, Nizar, et al.
Published: (2023)

Convex relaxation approaches for high-dimensional optimal transport
by: Khoo, Yuehaw, et al.
Published: (2025)

Worst-Case Learning under a Multi-fidelity Model
by: Foucart, Simon, et al.
Published: (2024)

Optimal Shapes for Tree Roots
by: Bressan, Alberto, et al.
Published: (2021)

Performance Estimation of second-order optimization methods on classes of univariate functions
by: Rubbens, Anne, et al.
Published: (2025)

An efficient second-order cone programming approach for dynamic optimal transport on staggered grid discretization
by: Chen, Liang, et al.
Published: (2025)

Quantitative contraction rates for Sinkhorn's algorithm: beyond bounded costs and compact marginals
by: Conforti, Giovanni, et al.
Published: (2023)

An Efficient Stochastic First-Order Algorithm for Nonconvex-Strongly Concave Minimax Optimization beyond Lipschitz Smoothness
by: Gao, Yan, et al.
Published: (2026)

ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
by: Kabgani, Alireza, et al.
Published: (2024)

Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization
by: Geremew, W., et al.
Published: (2026)

The Hard-Constraint PINNs for Interface Optimal Control Problems
by: Lai, Ming-Chih, et al.
Published: (2023)

A modified double inertial subgradient extragradient algorithm for non-monotone variational inequality with applications
by: Singh, Watanjeet, et al.
Published: (2026)

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

On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
by: Latafat, Puya, et al.
Published: (2023)

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
by: Latafat, Puya, et al.
Published: (2023)

On the Douglas-Rachford and Peaceman-Rachford algorithms in the presence of uniform monotonicity and the absence of minimizers
by: Burachik, Regina S., et al.
Published: (2022)

Quasi-Newton Method for Set Optimization Problems with Set-Valued Mapping Given by Finitely Many Vector-Valued Functions
by: Ghosh, Debdas, et al.
Published: (2024)

Asymptotic Consistency for Nonconvex Risk-Averse Stochastic Optimization with Infinite Dimensional Decision Spaces
by: Milz, Johannes, et al.
Published: (2022)

Fitted value iteration methods for bicausal optimal transport
by: Bayraktar, Erhan, et al.
Published: (2023)

The ratio-cut polytope and K-means clustering
by: De Rosa, Antonio, et al.
Published: (2020)