The complexity of approximating a nonlinear program
From MaRDI portal
Recommendations
- Complexity and algorithms for nonlinear optimization problems
- Approximation methods for problems of nonlinear programming
- scientific article; zbMATH DE number 847149
- The complexity of a special convex programming problem connected with nonlinear optimization
- An approximate algorithm for nonlinear integer programming
- An approximate algorithm for nonlinear integer programming
- scientific article; zbMATH DE number 1944142
- The approximation algorithm for solving a sort of non-smooth programming
- Approximation to nonproper problems of convex programming
- On the complexity of nonlinear mixed-integer optimization
Cites work
- scientific article; zbMATH DE number 3904619 (Why is no real title available?)
- scientific article; zbMATH DE number 176526 (Why is no real title available?)
- scientific article; zbMATH DE number 1256635 (Why is no real title available?)
- scientific article; zbMATH DE number 1256636 (Why is no real title available?)
- Approximation algorithms for indefinite quadratic programming
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
- Constructing roadmaps of semi-algebraic sets. I: Completeness
- Efficient probabilistically checkable proofs and applications to approximations
- Fully parallelized multi-prover protocols for NEXP-time
- Improved non-approximability results
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Multi-prover encoding schemes and three-prover proof systems
- Non-deterministic exponential time has two-prover interactive protocols
- On the hardness of approximating minimization problems
- On the power of multi-prover interactive protocols
- Quadratic programming is in NP
- Structure preserving reductions among convex optimization problems
- The Knowledge Complexity of Interactive Proof Systems
- The complexity of approximating a nonlinear program
- Two-Prover Protocols---Low Error at Affordable Rates
Cited in
(36)- scientific article; zbMATH DE number 69319 (Why is no real title available?)
- On the complexity of approximating a KKT point of quadratic programming
- Subdeterminants and concave integer quadratic programming
- Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension
- NP-hardness of deciding convexity of quartic polynomials and related problems
- scientific article; zbMATH DE number 3885655 (Why is no real title available?)
- A well-characterized approximation problem
- Differential approximation results for the traveling salesman problem with distances 1 and 2
- Obfuscation of pseudo-deterministic quantum circuits
- On the Complexity of Computing Two Nonlinearity Measures
- On the complexity of testing attainment of the optimal value in nonlinear optimization
- Proximity in concave integer quadratic programming
- Geometric optimization problems likely not contained in \(\mathbb A\mathbb P\mathbb X\)
- A PTAS for the minimization of polynomials of fixed degree over the simplex
- On the complexity of optimization over the standard simplex
- Separation between estimation and approximation
- Complexity results for some global optimization problems
- Approximate parametric searching
- An Analysis of Approximate Nonlinear Elimination
- Complexity of approximating bounded variants of optimization problems
- An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex
- FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
- scientific article; zbMATH DE number 845765 (Why is no real title available?)
- An approximation algorithm for indefinite mixed integer quadratic programming
- On the convergence rate of grid search for polynomial optimization over the simplex
- Cost approximation algorithms with nonmonotone line searches for a general class of nonlinear programs
- Approximation results for the weighted \(P_4\) partition problem
- Trigonometric approximation of the max-cut polytope is star-like
- scientific article; zbMATH DE number 2209720 (Why is no real title available?)
- Intractability of approximate multi-dimensional nonlinear optimization on independence systems
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey
- Copositive optimization -- recent developments and applications
- scientific article; zbMATH DE number 846225 (Why is no real title available?)
- On the advantage over a random assignment
- scientific article; zbMATH DE number 847149 (Why is no real title available?)
- On the space complexity of linear programming with preprocessing
This page was built for publication: The complexity of approximating a nonlinear program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1906280)
