Image de couverture de livre

Extragradient method with feasible inexact projection to variational inequality problem

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Millán, R. Díaz, Ferreira, O. P., Ugon, J.
Format:	Preprint
Publié:	2023
Sujets:	Optimization and Control 65K05, 90C30, 90C25
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Busemann hybrid projection-proximal point algorithm for optimization problems on Hadamard manifolds
par: Millán, R. Díaz, et autres
Publié: (2026)

On the convergence of proximal gradient methods for convex simple bilevel optimization
par: Latafat, Puya, et autres
Publié: (2023)

Preconditioned Proximal Gradient Methods with Conjugate Momentum: A Subspace Perspective
par: Chen, Jian, et autres
Publié: (2026)

Complexity of an inexact stochastic SQP algorithm for equality constrained optimization
par: O'Neill, Michael J., et autres
Publié: (2026)

A cut-and-project perspective for linearized Bregman iterations
par: Dai, Yu-Hong, et autres
Publié: (2024)

Steering exact penalty DCA for nonsmooth DC optimization problems with equality and inequality constraints
par: Dolgopolik, M. V.
Publié: (2021)

Nonsmooth Projection-Free Optimization with Functional Constraints
par: Asgari, Kamiar, et autres
Publié: (2023)

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
par: Takahashi, Shota, et autres
Publié: (2025)

Adaptive proximal gradient methods are universal without approximation
par: Oikonomidis, Konstantinos A., et autres
Publié: (2024)

Augmented Lagrangian methods for fully convex composite optimization
par: De Marchi, Alberto, et autres
Publié: (2025)

On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
par: Latafat, Puya, et autres
Publié: (2023)

Safeguarding adaptive methods: global convergence of Barzilai-Borwein and other stepsize choices
par: Ou, Hongjia, et autres
Publié: (2024)

The Global R-linear Convergence of Nesterov's Accelerated Gradient Method with Unknown Strongly Convex Parameter
par: Bao, Chenglong, et autres
Publié: (2023)

Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
par: Bao, Chenglong, et autres
Publié: (2024)

A descent method for nonsmooth multiobjective optimization problems on Riemannian manifolds
par: Tang, Chunming, et autres
Publié: (2023)

A novel numerical method tailored for unconstrained optimization problems
par: Li, Lin, et autres
Publié: (2025)

Lipschitz continuity of solution multifunctions of extended $\ell_1$ regularization problems
par: Meng, Kaiwen, et autres
Publié: (2024)

Efficient parameter-free restarted accelerated gradient methods for convex and strongly convex optimization
par: Sujanani, Arnesh, et autres
Publié: (2024)

Monomial barrier functions for the box-constrained convex optimization problems
par: Fayed, Hatem
Publié: (2024)

The iterates of FISTA convergence even under inexact computations and stochastic gradients
par: Salzo, Saverio
Publié: (2025)

An interior point method for nonlinear constrained derivative-free optimization
par: Brilli, Andrea, et autres
Publié: (2021)

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
par: Li, Qia, et autres
Publié: (2024)

Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
par: Marumo, Naoki, et autres
Publié: (2023)

On the asymptotic behavior of a higher-order extrapolation primal-dual interior-point method for nonlinear programming
par: Heeman, Pim, et autres
Publié: (2025)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
par: Zhou, Juan, et autres
Publié: (2024)

On circumcentered direct methods for monotone variational inequality problems
par: Behling, Roger, et autres
Publié: (2025)

The Grimmer--Shu--Wang Certificate and the Drori--Teboulle Minimax Constant-Stepsize Bound for $N\ge 3$
par: Zhang, Lixing
Publié: (2026)

Distributed Gradient-Regularized Newton Method: Scheduled Consensus and O(epsilon^{-1}) Global Iteration Complexity
par: Hu, Wei, et autres
Publié: (2026)

Hybrid optimal control with mixed-integer Lagrangian methods
par: Nikitina, Viktoriya, et autres
Publié: (2024)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
par: Niu, Yi-Shuai, et autres
Publié: (2018)

Randomized block proximal method with locally Lipschitz continuous gradient
par: Pérez-Aros, Pedro, et autres
Publié: (2025)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
par: Deng, Kangkang, et autres
Publié: (2024)

Affordable mixed-integer Lagrangian methods: optimality conditions and convergence analysis
par: De Marchi, Alberto
Publié: (2024)

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
par: He, Jiahuan, et autres
Publié: (2023)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
par: Kanzow, Christian, et autres
Publié: (2025)

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
par: Latafat, Puya, et autres
Publié: (2023)

Parallel block coordinate descent methods with identification strategies
par: Lopes, Ronaldo, et autres
Publié: (2025)

A structured L-BFGS method and its application to inverse problems
par: Mannel, Florian, et autres
Publié: (2023)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
par: Zhang, Chenyu, et autres
Publié: (2023)

A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
par: Zhou, Junpeng, et autres
Publié: (2025)