arXiv (All)
open access
An Adaptive Cubic Regularisation Algorithm Based on Interior-Point Methods for Optimization with General Inequality Constraints
Nonlinear constrained optimization has a wide range of practical applications. The interior-point method is considered to be one of the most powerful algorithms for solving nonlinear inequality constrained optimization. In this paper, we consider optimization with general inequality constraints and
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
- Hybrid Finite-Volume Finite-Difference Scheme for the Solution of Boussinesq Equations.#1039434
- Exact computation of the color function for triangular element interfaces#1013397
- A higher order lattice-based method for high-dimensional numerical integration using periodization#1156048
- Sharp bounds for higher mixed Steklov-Robin eigenvalues on domains with holes#1035733
- Using 3D Imaging to Optimize Bifurcation Stenting#906465
Record · ID 1357328
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