Treffer: Intractability of approximate multi-dimensional nonlinear optimization on independence systems
Title:
Intractability of approximate multi-dimensional nonlinear optimization on independence systems
Authors:
Source:
Discrete mathematics. 311(8-9):780-783
Publisher Information:
Kidlington: Elsevier, 2011.
Publication Year:
2011
Physical Description:
print, 6 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Algèbre, Algebra, Géométrie algébrique, Algebraic geometry, Analyse mathématique, Mathematical analysis, Calcul des variations et contrôle optimal, Calculus of variations and optimal control, Analyse numérique. Calcul scientifique, Numerical analysis. Scientific computation, Analyse numérique, Numerical analysis, Méthodes numériques en programmation mathématique, optimisation et calcul variationnel, Numerical methods in mathematical programming, optimization and calculus of variations, Optimisation et calcul variationnel numériques, Numerical methods in optimization and calculus of variations, Combinatoire, Combinatorics, Combinatoria, Fonction non linéaire, Non linear function, Función no lineal, Fonction objectif, Objective function, Función objetivo, Indépendance, Independence, Independencia, Mathématiques discrètes, Discrete mathematics, Matemáticas discretas, Méthode optimisation, Optimization method, Método optimización, Oracle, Système linéaire, Linear system, Sistema lineal, Système non linéaire, Non linear system, Sistema no lineal, Temps polynomial, Polynomial time, Tiempo polinomial, 14C20, 49XX, 65F05, 65F10, 65K10, 65Kxx, Intractabilité, Optimisation discrète, Temps exponentiel, Erdős―Ko-Rado, Inapproximability, Nonlinear discrete optimization
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
IBM T.J. Watson Research Center, Yorktown Heights, United States
Technion - Israel Institute of Technology, Haifa, Israel
ETH, Zürich, Switzerland
Technion - Israel Institute of Technology, Haifa, Israel
ETH, Zürich, Switzerland
ISSN:
0012-365X
Rights:
Copyright 2015 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Mathematics
Accession Number:
edscal.23953383
Database:
PASCAL Archive
Weitere Informationen
We consider optimization of nonlinear objective functions that balance d linear criteria over n-element independence systems presented by linear-optimization oracles. For d = 1, we have previously shown that an r-best approximate solution can be found in polynomial time. Here, using an extended Erdős―Ko―Rado theorem of Frankl, we show that for d = 2, finding a pn-best solution requires exponential time.