arXiv (All)
open access
Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
In this paper we explore a relevant aspect of the interplay between two core elements of global optimization algorithms for nonconvex nonlinear programming problems. The first one is the reformulation of the original problem, which requires the introduction of auxiliary variables with the goal of de
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
- Averaged proximal reflected gradient method for monotone variational inequalities#973988
- Global optimization tailored for graphics processing units: Complete and rigorous search for large-scale nonlinear minimization#141775
- Accelerated primal--dual dynamics and algorithms for convex optimization with nonlinear inequality constraints#821350
- Decentralized Projection-free Online Upper-Linearizable Optimization with Applications to DR-Submodular Optimization#1144705
- Solving the Offline and Online Min-Max Problem of Non-smooth Submodular-Concave Functions: A Zeroth-Order Approach#974311
Record · ID 1218335
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