Pages that link to "Item:Q2205977"
From MaRDI portal
The following pages link to On the complexity of testing attainment of the optimal value in nonlinear optimization (Q2205977):
Displayed 5 items.
- Existence of Pareto solutions for vector polynomial optimization problems with constraints (Q2082235) (← links)
- Existence of efficient and properly efficient solutions to problems of constrained vector optimization (Q2235148) (← links)
- Tangencies and polynomial optimization (Q6038670) (← links)
- Homogenization for polynomial optimization with unbounded sets (Q6044977) (← links)
- How Do Exponential Size Solutions Arise in Semidefinite Programming? (Q6195320) (← links)
