Image de couverture de livre

Spectral conjugate gradient projection methods for large-scale monotone equations without Lipschitz continuity

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hamiss, Kabenge, Alshahrani, Mohammed, Syed, Mujahid N.
Format:	Preprint
Publié:	2026
Sujets:	Optimization and Control Numerical Analysis 65H10, 65K05, 90C30, 90C56
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

A New Two-dimensional Model-based Subspace Method for Large-scale Unconstrained Derivative-free Optimization: 2D-MoSub
par: Xie, Pengcheng, et autres
Publié: (2023)

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

Privacy-Preserving Black-Box Optimization (PBBO): Theory and the Model-Based Algorithm DFOp
par: Xie, Pengcheng
Publié: (2025)

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

Adaptive Metrics for Norm-Minimization-Based Outer Approximation in Convex Vector Optimization
par: Alshahrani, Mohammed
Publié: (2026)

Accuracy and Relationships of Quadratic Models in Derivative-free Optimization
par: Chen, Yiwen, et autres
Publié: (2026)

$Q$-fully Quadratic Modeling and its Application in a Random Subspace Derivative-free Method
par: Chen, Yiwen, et autres
Publié: (2023)

BUP-TR: Bayesian Underdetermined Projection Trust-Region Methods for Derivative-Free Optimization
par: Hu, Wei, et autres
Publié: (2026)

MATRO: Metric-Aware Trust-Region Optimization with Fully Quadratic Models
par: Hu, Wei, et autres
Publié: (2026)

Nonlinear Derivative-free Constrained Optimization with a Penalty-Interior Point Method and Direct Search
par: Brilli, Andrea, et autres
Publié: (2024)

CLARSTA: A random subspace trust-region algorithm for convex-constrained derivative-free optimization
par: Chen, Yiwen, et autres
Publié: (2025)

PDFO: A Cross-Platform Package for Powell's Derivative-Free Optimization Solvers
par: Ragonneau, Tom M., et autres
Publié: (2023)

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

A Unified Zeroth-Order Proximal Newton-Type Framework for Composite Optimization
par: Liu, Zekun, et autres
Publié: (2026)

Two Generalized Derivative-free Methods to Solve Large Scale Nonlinear Equations with Convex Constraints
par: Hamiss, Kabenge, et autres
Publié: (2025)

EnKSGD: A Class Of Preconditioned Black Box Optimization And Inversion Algorithms
par: Irwin, Brian, et autres
Publié: (2023)

A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach
par: Monteiro, Renato D. C., et autres
Publié: (2024)

Dropout Ensemble Kalman inversion for high dimensional inverse problems
par: Liu, Shuigen, et autres
Publié: (2023)

On the Global Convergence of Particle Swarm Optimization Methods
par: Huang, Hui, et autres
Publié: (2022)

Convergence Rates for $\ell_p$ Norm Minimization in Convex Vector Optimization
par: Alshahrani, Mohammed
Publié: (2026)

Strong Global Convergence of the Consensus-Based Optimization Algorithm
par: Bonandin, Sabrina, et autres
Publié: (2025)

An interior-point trust-region method for nonsmooth regularized bound-constrained optimization
par: Leconte, Geoffroy, et autres
Publié: (2024)

Moreau envelope and proximal-point methods under the lens of high-order regularization
par: Kabgani, Alireza, et autres
Publié: (2025)

A structured L-BFGS method with diagonal scaling and its application to image registration
par: Mannel, Florian, et autres
Publié: (2024)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
par: Deng, Kangkang, et autres
Publié: (2025)

Convergence rate of the (1+1)-evolution strategy on locally strongly convex functions with lipschitz continuous gradient
par: Morinaga, Daiki, et autres
Publié: (2022)

Global optimization of multivariable functions satisfying the Vanderbei condition
par: Arutyunova, Natalya, et autres
Publié: (2019)

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

ASPEN: An Additional Sampling Penalty Method for Finite-Sum Optimization Problems with Nonlinear Equality Constraints
par: Krejić, Nataša, et autres
Publié: (2025)

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

A particle consensus approach to solving nonconvex-nonconcave min-max problems
par: Borghi, Giacomo, et autres
Publié: (2024)

Well-posedness and mean-field limit estimate of a consensus-based algorithm for min-max problems
par: Huang, Hui, et autres
Publié: (2026)

A non-monotone trust-region method with noisy oracles and additional sampling
par: Krejic, Natasa, et autres
Publié: (2023)

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

Inexact Proximal Point Algorithms for Zeroth-Order Global Optimization
par: Zhang, Minxin, et autres
Publié: (2024)

An Optimal Interpolation Set for Model-Based Derivative-Free Optimization Methods
par: Ragonneau, Tom M., et autres
Publié: (2023)

Delayed Feedback in Online Non-Convex Optimization: A Non-Stationary Approach with Applications
par: Lara, Felipe, et autres
Publié: (2024)

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

Nonlinear conjugate gradient for smooth convex functions
par: Karimi, Sahar, et autres
Publié: (2021)