Pages that link to "Item:Q2899035"
From MaRDI portal
The following pages link to Convexity and concavity detection in computational graphs: tree walks for convexity assessment (Q2899035):
Displaying 11 items.
- DrAmpl: A meta solver for optimization problem analysis (Q601972) (← links)
- A hybrid LP/NLP paradigm for global optimization relaxations (Q1621693) (← links)
- A polyhedral branch-and-cut approach to global optimization (Q1780949) (← links)
- SUSPECT: MINLP special structure detector for Pyomo (Q2182769) (← links)
- On the complexity of detecting convexity over a box (Q2191776) (← links)
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
- A general framework for convexity analysis in deterministic global optimization (Q2392103) (← links)
- Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests (Q3589077) (← links)
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework (Q4637831) (← links)
- The Conjugate Residual Method in Linesearch and Trust-Region Methods (Q5231696) (← links)
- An extended version of the memoryless DFP algorithm with the sufficient descent property (Q6634291) (← links)