Cover Image

Where's Ben Nevis? A 2D optimisation benchmark with 957,174 local optima based on Great Britain terrain data

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wei, Yuhang, Clerx, Michael, Mirams, Gary R.
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control 90C26, 65K05 G.1.6
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Adaptive Stochastic Gradient Descent Ascent Algorithm for Nonconvex Minimax Problems with Decision-Dependent Distributions
by: Gao, Yan, et al.
Published: (2025)

A Primal-Dual Frank-Wolfe Algorithm for Linear Programming
by: Hough, Matthew, et al.
Published: (2024)

Escaping Saddle Points via Curvature-Calibrated Perturbations: A Complete Analysis with Explicit Constants and Empirical Validation
by: Alpay, Faruk, et al.
Published: (2025)

Shadow splitting methods for nonconvex optimisation: epi-approximation, convergence and saddle point avoidance
by: Atenas, Felipe
Published: (2025)

Convergence rate of the (1+1)-evolution strategy on locally strongly convex functions with lipschitz continuous gradient
by: Morinaga, Daiki, et al.
Published: (2022)

Data-Dependent Complexity of First-Order Methods for Binary Classification
by: Hough, Matthew, et al.
Published: (2025)

Projections onto Spectral Matrix Cones
by: Cederberg, Daniel, et al.
Published: (2025)

Implicit augmented Lagrangian and generalized optimization
by: De Marchi, Alberto
Published: (2023)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
by: Zhou, Juan, et al.
Published: (2024)

Local Convergence of Adaptively Regularized Tensor Methods
by: Welzel, Karl, et al.
Published: (2025)

Active set identification and rapid convergence for degenerate primal-dual problems
by: Díaz, Mateo, et al.
Published: (2026)

On the local and global minimizers of the smooth stress function in Euclidean Distance Matrix problems
by: Song, Mengmeng, et al.
Published: (2024)

Sparse Training of Neural Networks based on Multilevel Mirror Descent
by: Lunk, Yannick, et al.
Published: (2026)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
by: Deng, Kangkang, et al.
Published: (2025)

An Algorithm to Solve Cardinality Constrained Quadratic Optimization Problem with an Application to the Best Subset Selection in Regression
by: Singh, Vikram, et al.
Published: (2025)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
by: Xie, Xiyuan, et al.
Published: (2025)

On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models
by: Li, Wenjing, et al.
Published: (2023)

Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
by: Marumo, Naoki, et al.
Published: (2023)

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
by: Li, Qia, et al.
Published: (2024)

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

Strong Partitioning and a Machine Learning Approximation for Accelerating the Global Optimization of Nonconvex QCQPs
by: Kannan, Rohit, et al.
Published: (2022)

Convergence-Guaranteed Algorithms for l1/2-Regularized Quadratic Programs with Assignment Constraints
by: Xie, Lijun, et al.
Published: (2025)

Local Convergence Analysis of ADMM for Nonconvex Composite Optimization
by: Xie, Xiyuan, et al.
Published: (2026)

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

Randomized block proximal method with locally Lipschitz continuous gradient
by: Pérez-Aros, Pedro, et al.
Published: (2025)

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

Sufficiently Regularized Nonnegative Quartic Polynomials are Sum-of-Squares
by: Zhu, Wenqi, et al.
Published: (2026)

Quadratic Surrogate Attractor for Particle Swarm Optimization
by: Clemente, Maurizio, et al.
Published: (2026)

Accelerated-gradient-based generalized Levenberg--Marquardt method with oracle complexity bound and local quadratic convergence
by: Marumo, Naoki, et al.
Published: (2022)

Zeroth-order gradient estimators for stochastic problems with decision-dependent distributions
by: Hikima, Yuya, et al.
Published: (2025)

ASMOP: Additional sampling stochastic trust region method for multi-objective problems
by: Jerinkić, Nataša Krklec, et al.
Published: (2025)

IPAS: An Adaptive Sample Size Method for Weighted Finite Sum Problems with Linear Equality Constraints
by: Krejić, Nataša, et al.
Published: (2025)

Majorization-Minimization-Based Levenberg--Marquardt Method for Constrained Nonlinear Least Squares
by: Marumo, Naoki, et al.
Published: (2020)

FlowAdam: Implicit Regularization via Geometry-Aware Soft Momentum Injection
by: Singh, Devender, et al.
Published: (2026)

CAO: Curvature-Adaptive Optimization via Periodic Low-Rank Hessian Sketching
by: Du, Wenzhang
Published: (2025)

Convergence of Descent Optimization Algorithms under Polyak-Łojasiewicz-Kurdyka Conditions
by: Bento, G. C., et al.
Published: (2024)

An Inexact Boosted Difference of Convex Algorithm for Nondifferentiable Functions
by: Ferreira, Orizon P., et al.
Published: (2024)

Understanding the Douglas-Rachford splitting method through the lenses of Moreau-type envelopes
by: Atenas, Felipe
Published: (2023)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
by: Deng, Kangkang, et al.
Published: (2024)

An inexact infeasible arc-search interior-point method for linear optimization problems
by: Iida, Einosuke, et al.
Published: (2024)