The complexity of optimizing over a simplex, hypercube or sphere: a short survey (Q940826): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q172145
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10100-007-0052-9 / rank
Normal rank
 
Property / author
 
Property / author: Etienne de Klerk / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10100-007-0052-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2114467398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure preserving reductions among convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integration and optimization of multivariate polynomials by restriction onto a random subspace / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of approximating a nonlinear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity versus Degeneracy in Dynamics, Games, and Optimization: A Unified Approach to Different Aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4464661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Electrostatics to Almost Optimal Nodal Sets for Polynomial Interpolation in a Simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for global optimization in case of unknown Lipschitz constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for the Crossing Numbers of Km,n and Kn / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of optimization over the standard simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for the minimization of polynomials of fixed degree over the simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxation and nonconvex quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic and stochastic error bounds in numerical analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of the S-Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity of quadratic transformations and its use in control and optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact duality theory for semidefinite programming and its complexity implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675212 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10100-007-0052-9 / rank
 
Normal rank

Latest revision as of 09:00, 10 December 2024

scientific article
Language Label Description Also known as
English
The complexity of optimizing over a simplex, hypercube or sphere: a short survey
scientific article

    Statements

    The complexity of optimizing over a simplex, hypercube or sphere: a short survey (English)
    0 references
    3 September 2008
    0 references
    computational complexity
    0 references
    global optimization
    0 references
    linear and semidefinite programming
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers