NYU Faculty Digital Archive
metadata only
APPROXIMATING SEPARABLE NONLINEAR FUNCTIONS VIA MIXED ZERO-ONE PROGRAMS
We discuss two models from the literature that have been developed to formulate piecewise linear approximation of separable nonlinear functions by way of mixed-integer programs. We show that the most commonly proposed method is computationally inferior to a lesser known technique by comparing ana
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
- Tight Transition Time Bounds for Separable Logistic Regression at the Edge of Stability#1156731
- Solving the Offline and Online Min-Max Problem of Non-smooth Submodular-Concave Functions: A Zeroth-Order Approach#974311
- A New Lineserach for Accelerated Composite Minimization#925709
- Gradient Based Optimization Methods for Robust Learning and Biomedical Signal Modeling#210703
- Computing the convex envelope of bivariate piecewise linear-quadratic functions in linear time#1013940
Record · ID 941672
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