Pages that link to "Item:Q1598884"
From MaRDI portal
The following pages link to Lagrangian bounds in multiextremal polynomial and discrete optimization problems (Q1598884):
Displaying 16 items.
- On N. Z. Shor's three scientific ideas (Q380646) (← links)
- Theory and software implementations of Shor's \(r\)-algorithms (Q681720) (← links)
- Functionally redundant constraints for Boolean quadratic-type optimization problems (Q852258) (← links)
- \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization (Q989898) (← links)
- Bounds for Lagrange multipliers and optimal points (Q1802498) (← links)
- Isotonicity of minimizers in polychotomous discrete interval search via lattice programming (Q1974027) (← links)
- Strong duality for general quadratic programs with quadratic equality constraints (Q2082247) (← links)
- A method to solve conditional optimization problems with quadratic objective functions on the set of permutations (Q2215299) (← links)
- Solutions of the combinatorial problem with a quadratic fractional objective function on the set of permutations (Q2215587) (← links)
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions (Q2330641) (← links)
- On solving nonconvex optimization problems by reducing the duality gap (Q2494287) (← links)
- Lagrangian quadratic bounds in polynomial nonconvex and Boolean models with superfluous constraints (Q2768043) (← links)
- Discrete Optimization with Polynomially Detectable Boundaries and Restricted Level Sets (Q3066152) (← links)
- Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program (Q3553752) (← links)
- (Q5093671) (← links)
- Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube (Q5108258) (← links)
