Pages that link to "Item:Q1288665"
From MaRDI portal
The following pages link to Role of redundant constraints for improving dual bounds in polynomial optimization problems (Q1288665):
Displaying 11 items.
- Functionally redundant constraints for Boolean quadratic-type optimization problems (Q852258) (← links)
- A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization (Q881511) (← links)
- A method for computing lowest eigenvalues of symmetric polynomial differential operators by semidefinite programming (Q984697) (← links)
- Dual quadratic estimates in polynomial and Boolean programming (Q1173717) (← links)
- Dual estimates in multiextremal problems (Q1201906) (← links)
- Modified \(r\)-algorithm to find the global minimum of polynomial functions (Q1280905) (← links)
- Lagrangian bounds in multiextremal polynomial and discrete optimization problems (Q1598884) (← links)
- Constructing a quasi-concave quadratic objective function from interviewing a decision maker (Q1847215) (← links)
- A computational approach to non-smooth optimization by diffusion equations (Q2222070) (← links)
- Dual approaches to finite element model updating (Q2428104) (← links)
- Nonsmooth optimization and dual bounds (Q3972976) (← links)
