Pages that link to "Item:Q1906280"
From MaRDI portal
The following pages link to The complexity of approximating a nonlinear program (Q1906280):
Displaying 32 items.
- Copositive optimization -- recent developments and applications (Q421783) (← links)
- On the convergence rate of grid search for polynomial optimization over the simplex (Q519777) (← links)
- Intractability of approximate multi-dimensional nonlinear optimization on independence systems (Q533792) (← links)
- Approximate parametric searching (Q685496) (← links)
- A well-characterized approximation problem (Q688442) (← links)
- On the complexity of optimization over the standard simplex (Q932197) (← links)
- Approximation results for the weighted \(P_4\) partition problem (Q935845) (← links)
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey (Q940826) (← links)
- FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension (Q948960) (← links)
- Complexity results for some global optimization problems (Q1024247) (← links)
- On the complexity of finding stationary points of nonconvex quadratic programs (Q1272568) (← links)
- On the complexity of approximating a KKT point of quadratic programming (Q1380927) (← links)
- Geometric optimization problems likely not contained in \(\mathbb A\mathbb P\mathbb X\) (Q1864187) (← links)
- Differential approximation results for the traveling salesman problem with distances 1 and 2 (Q1869490) (← links)
- NP-hardness of deciding convexity of quartic polynomials and related problems (Q1942256) (← links)
- Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension (Q2045012) (← links)
- Proximity in concave integer quadratic programming (Q2149572) (← links)
- On the complexity of testing attainment of the optimal value in nonlinear optimization (Q2205977) (← links)
- An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex (Q2349131) (← links)
- Complexity of approximating bounded variants of optimization problems (Q2368970) (← links)
- A PTAS for the minimization of polynomials of fixed degree over the simplex (Q2503350) (← links)
- Trigonometric approximation of the max-cut polytope is star-like (Q2673542) (← links)
- On the space complexity of linear programming with preprocessing (Q2800577) (← links)
- Separation between Estimation and Approximation (Q2989040) (← links)
- (Q4014788) (← links)
- (Q4864960) (← links)
- An Analysis of Approximate Nonlinear Elimination (Q4874541) (← links)
- Cost approximation algorithms with nonmonotone line searches for a general class of nonlinear programs (Q4944413) (← links)
- On the Complexity of Computing Two Nonlinearity Measures (Q4981157) (← links)
- Subdeterminants and Concave Integer Quadratic Programming (Q5206942) (← links)
- On the advantage over a random assignment (Q5894908) (← links)
- An approximation algorithm for indefinite mixed integer quadratic programming (Q6165586) (← links)