arXiv (All)
open access
Lipschitz-inspired HALRECT Algorithm for Derivative-free Global Optimization
This article considers a box-constrained global optimization problem for Lipschitz-continuous functions with an unknown Lipschitz constant. Motivated by the famous DIRECT (DIviding RECTangles), a new HALRECT (HALving RECTangles) algorithm is introduced. A new deterministic approach combines halving
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- An Adaptive Computational Framework for Structural Shape Optimization: Deterministic and Robust Formulations#1040206
- Global optimization tailored for graphics processing units: Complete and rigorous search for large-scale nonlinear minimization#141775
- Online Convex Optimization with Sublinear Noisy Probes#271829
- Non-linear Characterization of Commercial and Decellularized Hydrogels: Statistical Framework Enhanced by Bayesian Optimization.#371383
- Solving the Offline and Online Min-Max Problem of Non-smooth Submodular-Concave Functions: A Zeroth-Order Approach#974311
Record · ID 986063
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive