Image de couverture de livre

CLARSTA: A random subspace trust-region algorithm for convex-constrained derivative-free optimization

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chen, Yiwen, Hare, Warren, Wiebe, Amy
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control 90C56, 65K05, 90C06
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

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

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

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

Mixed-integer linearity in nonlinear optimization: a trust region approach
par: De Marchi, Alberto
Publié: (2023)

A general framework for floating point error analysis of simplex derivatives
par: Chen, Yiwen, et autres
Publié: (2024)

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

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

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

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

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

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

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

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

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)

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

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

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

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

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

An investigation of stochastic trust-region based algorithms for finite-sum minimization
par: Bellavia, Stefania, et autres
Publié: (2024)

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

Stability and convergence analysis of AdaGrad for non-convex optimization via novel stopping time-based techniques
par: Jin, Ruinan, et autres
Publié: (2024)

Complexity of trust-region methods with unbounded Hessian approximations for smooth and nonsmooth optimization
par: Leconte, Geoffroy, et autres
Publié: (2023)

A linesearch-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization
par: Zeng, Hanfeng, et autres
Publié: (2026)

Linesearch-free adaptive Bregman proximal gradient for convex minimization without relative smoothness
par: Ou, Hongjia, et autres
Publié: (2025)

Randomized subspace correction methods for convex optimization
par: Jiang, Boou, et autres
Publié: (2025)

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

Line-search and Adaptive Step Sizes for Nonconvex-strongly-concave Minimax Optimization
par: Ma, Bohao, et autres
Publié: (2026)

Simplex Frank-Wolfe: Linear Convergence and Its Numerical Efficiency for Convex Optimization over Polytopes
par: Wang, Haoning, et autres
Publié: (2025)

A MINRES-based Linesearch Algorithm for Nonconvex Optimization with Non-positive Curvature Detection
par: Zeng, Hanfeng, et autres
Publié: (2026)

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
par: Kabgani, Alireza, et autres
Publié: (2025)

Bregman Stochastic Proximal Point Algorithm with Variance Reduction
par: Traoré, Cheik, et autres
Publié: (2025)

Variational Properties of Decomposable Functions. Part I: Strict Epi-Calculus and Applications
par: Ouyang, Wenqing, et autres
Publié: (2023)

A Lasry-Lions envelope approach for mathematical programs with complementarity constraints
par: Wang, Jia, et autres
Publié: (2025)

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

Variational Properties of Decomposable Functions. Part II: Strong Second-Order Theory
par: Ouyang, Wenqing, et autres
Publié: (2023)

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

A stochastic use of the Kurdyka-Lojasiewicz property: Investigation of optimization algorithms behaviours in a non-convex differentiable framework
par: Fest, Jean-Baptiste, et autres
Publié: (2023)