Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,473,037 papers from all fields of science
Search
Sign In
Create Free Account
Optimization problem
Known as:
NP optimization problem
, Optimal solution
, Optimal value
In mathematics and computer science, an optimization problem is the problem of finding the best solution from all feasible solutions. Optimization…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
APX
Approximation-preserving reduction
BOBYQA
Backpropagation
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
Proximal Policy Optimization Algorithms
John Schulman
,
Filip Wolski
,
Prafulla Dhariwal
,
Alec Radford
,
Oleg Klimov
arXiv.org
2017
Corpus ID: 28695052
We propose a new family of policy gradient methods for reinforcement learning, which alternate between sampling data through…
Expand
Highly Cited
2011
Highly Cited
2011
Robust Solutions of Optimization Problems Affected by Uncertain Probabilities
A. Ben-Tal
,
D. Hertog
,
A. Waegenaere
,
B. Melenberg
,
G. Rennen
Management Sciences
2011
Corpus ID: 761793
In this paper we focus on robust linear optimization problems with uncertainty regions defined by φ-divergences for example, chi…
Expand
Highly Cited
2007
Highly Cited
2007
Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems
D. Karaboğa
,
B. Basturk
International Fuzzy Systems Association World…
2007
Corpus ID: 6379724
This paper presents the comparison results on the performance of the Artificial Bee Colony (ABC) algorithm for constrained…
Expand
Highly Cited
2003
Highly Cited
2003
An Introduction to Variable and Feature Selection
Isabelle M Guyon
,
A. Elisseeff
Journal of machine learning research
2003
Corpus ID: 379259
Variable and feature selection have become the focus of much research in areas of application for which datasets with tens or…
Expand
Highly Cited
2000
Highly Cited
2000
Global Optimization with Polynomials and the Problem of Moments
J. Lasserre
SIAM Journal on Optimization
2000
Corpus ID: 16740871
We consider the problem of finding the unconstrained global minimum of a real-valued polynomial p(x): {\mathbb{R}}^n\to {\mathbb…
Expand
Highly Cited
2000
Highly Cited
2000
Genetic quantum algorithm and its application to combinatorial optimization problem
Kuk-Hyun Han
,
Jong-Hwan Kim
Proceedings of the Congress on Evolutionary…
2000
Corpus ID: 14197548
This paper proposes a novel evolutionary computing method called a genetic quantum algorithm (GQA). GQA is based on the concept…
Expand
Highly Cited
1997
Highly Cited
1997
Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces
R. Storn
,
K. Price
Journal of Global Optimization
1997
Corpus ID: 5297867
A new heuristic approach for minimizing possiblynonlinear and non-differentiable continuous spacefunctions is presented. By means…
Expand
Highly Cited
1994
Highly Cited
1994
Problem Formulation for Multidisciplinary Optimization
E. Cramer
,
J. Dennis
,
P. Frank
,
R. Lewis
,
G. R. Shubin
SIAM Journal on Optimization
1994
Corpus ID: 14590794
This paper is about multidisciplinary (design) optimization, or MDO, the coupling of two or more analysis disciplines with…
Expand
Highly Cited
1992
Highly Cited
1992
Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
M. Fukushima
Mathematical programming
1992
Corpus ID: 206799821
Whether or not the general asymmetric variational inequality problem can be formulated as a differentiable optimization problem…
Expand
Highly Cited
1986
Highly Cited
1986
The complexity of optimization problems
Mark W. Krentel
Symposium on the Theory of Computing
1986
Corpus ID: 9900543
We study computational complexity theory and define a class of optimization problems called OptP (Optimization Polynomial Time…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE