Pages that link to "Item:Q2432723"
From MaRDI portal
The following pages link to Global optimization of separable objective functions on convex polyhedra via piecewise-linear approximation (Q2432723):
Displaying 15 items.
- An effective linear approximation method for separable programming problems (Q1036545) (← links)
- Optimal objective function approximation for separable convex quadratic programming (Q1340073) (← links)
- Constraint decomposition algorithms in global optimization (Q1342897) (← links)
- A geometric approach to global optimization (Q1819194) (← links)
- A global optimization method for nonconvex separable programming problems (Q1847169) (← links)
- Piecewise linear bounding functions in univariate global optimization (Q2156897) (← links)
- Linearly constrained global optimization via piecewise-linear approximation (Q2479373) (← links)
- Global minimization via piecewise-linear underestimation (Q2569149) (← links)
- A nonconvex, piecewise linear optimization problem (Q2640447) (← links)
- Continuous global optimization over polyhedrons: A new introduction to optimization (Q2720360) (← links)
- (Q3372231) (← links)
- Checking Integral Real-Time Automata for Extended Linear Duration Invariants (Q3460214) (← links)
- Piecewise-Linear Approximation Methods for Nonseparable Convex Optimization (Q3793946) (← links)
- Integer Programming and Combinatorial Optimization (Q5712456) (← links)
- Maximin Problem and a Duality Theorem for Mixed‐Integer Quadratic Programming (Q5902903) (← links)