The following pages link to Semidefinite programming (Q1600854):
Displaying 29 items.
- Optimal design of multi-response experiments using semi-definite programming (Q374619) (← links)
- Improved estimation of duality gap in binary quadratic programming using a weighted distance measure (Q439501) (← links)
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
- Robust Farkas' lemma for uncertain linear systems with applications (Q548208) (← links)
- Semidefinite programming for dynamic steady-state analysis of structures under uncertain harmonic loads (Q660375) (← links)
- Construction of a class of sharp Löwner majorants for a set of symmetric matrices (Q778636) (← links)
- Image space analysis for vector variational inequalities with matrix inequality constraints and applications (Q983716) (← links)
- Multiobjective duality for convex semidefinite programming problems (Q1431149) (← links)
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs (Q1706408) (← links)
- Strong duality and minimal representations for cone optimization (Q1928754) (← links)
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
- Semidefinite programming via image space analysis (Q2358284) (← links)
- Partial Lagrangian relaxation for the unbalanced orthogonal Procrustes problem (Q2454077) (← links)
- Confidence ellipsoids for static response of trusses with load and structural uncertainties (Q2459238) (← links)
- A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions (Q2465563) (← links)
- Exploiting semidefinite relaxations in constraint programming (Q2489123) (← links)
- An evaluation of semidefinite programming based approaches for discrete lot-sizing problems (Q2514881) (← links)
- Semidefinite programming for uncertain linear equations in static analysis of structures (Q2638116) (← links)
- Matrix Relaxations in Combinatorial Optimization (Q2897308) (← links)
- Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints (Q3430018) (← links)
- A guide to conic optimisation and its applications (Q4634309) (← links)
- Semidefinite relaxation for linear programs with equilibrium constraints (Q4921222) (← links)
- Collective mental accounting: an integrated behavioural portfolio selection model for multiple mental accounts (Q5234291) (← links)
- A new method of updating mass and stiffness matrices simultaneously with no spillover (Q5270784) (← links)
- Validating numerical semidefinite programming solvers for polynomial invariants (Q5916266) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881) (← links)
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← links)
- New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction (Q5949888) (← links)
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)
