Pages that link to "Item:Q1777448"
From MaRDI portal
The following pages link to An approximation approach to non-strictly convex quadratic semi-infinite programming (Q1777448):
Displaying 14 items.
- A generalization of the Karush-Kuhn-Tucker theorem for approximate solutions of mathematical programming problems based on quadratic approximation (Q722399) (← links)
- Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints (Q1785385) (← links)
- Optimal solution approximation for infinite positive-definite quadratic programming (Q1897449) (← links)
- Asymptotic approximation method and its convergence on semi-infinite programming (Q2495272) (← links)
- (Q2994051) (← links)
- On semidefinite bounds for maximization of a non-convex quadratic objective over the<i>l<sub>1</sub></i>unit ball (Q3635701) (← links)
- (Q4224866) (← links)
- (Q4288339) (← links)
- (Q4318729) (← links)
- (Q4349352) (← links)
- On solving convex quadratic semi-infinite programming probelms (Q4764835) (← links)
- (Q4984331) (← links)
- (Q5116062) (← links)
- Recent advances in nonconvex semi-infinite programming: applications and algorithms (Q6114904) (← links)