About: Quadratic programming

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Quadratic programming Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

Quadratic programming (QP) is the process of solving certain mathematical optimization problems involving quadratic functions. Specifically, one seeks to optimize (minimize or maximize) a multivariate quadratic function subject to linear constraints on the variables. Quadratic programming is a type of nonlinear programming.

Attributes	Values
rdf:type	Thing
rdfs:label	Quadratic programming (en)
rdfs:comment	Quadratic programming (QP) is the process of solving certain mathematical optimization problems involving quadratic functions. Specifically, one seeks to optimize (minimize or maximize) a multivariate quadratic function subject to linear constraints on the variables. Quadratic programming is a type of nonlinear programming. (en)
rdfs:seeAlso	Duality (optimization)
sameAs	Quadratic programming
dbp:wikiPageUsesTemplate	dbt:Cite_book dbt:Cite_web dbt:Expert_needed dbt:Math dbt:Mvar dbt:Reflist dbt:See_also dbt:Short_description dbt:Optimization_algorithms dbt:Mathematical_programming
Subject	Optimization algorithms and methods
gold:hypernym	Type
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Quadratic_programming?oldid=1065899797&ns=0
Wikipage page ID	40324 (xsd:integer)
page length (characters) of wiki page	18633 (xsd:nonNegativeInteger)
Wikipage revision ID	1065899797 (xsd:integer)
has abstract	Quadratic programming (QP) is the process of solving certain mathematical optimization problems involving quadratic functions. Specifically, one seeks to optimize (minimize or maximize) a multivariate quadratic function subject to linear constraints on the variables. Quadratic programming is a type of nonlinear programming. "Programming" in this context refers to a formal procedure for solving mathematical problems. This usage dates to the 1940s and is not specifically tied to the more recent notion of "computer programming." To avoid confusion, some practitioners prefer the term "optimization" — e.g., "quadratic optimization." (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Quadratic_programming
is Wikipage redirect of	List of solvers for quadratic programming problems Quadratic program
is Link from a Wikipage to another Wikipage of	FortMP Nl (format) Non-negative least squares Non-negative matrix factorization Nonlinear programming AIMMS AMPL APOPT Active-set method Basis pursuit denoising CPLEX CUTEr Gekko (optimization software) George Dantzig Octeract Engine Criss-cross algorithm Hydrological optimization Linear complementarity problem Linear programming List of numerical analysis topics List of solvers for quadratic programming problems Complementarity theory Constrained optimization Contact dynamics Convex optimization List of NP-complete problems List of RNA-Seq bioinformatics tools Mehrotra predictor–corrector method GAUSS (software) Galahad library Kelly criterion FICO Xpress Feature selection Modern portfolio theory Isotonic regression Loss functions for classification Layered graph drawing Least-squares support-vector machine Least squares M-matrix Margin-infused relaxed algorithm Mathematical finance Mathematical optimization Matrix (mathematics) Matthew Brand Natural resonance theory
is known for of	George Dantzig

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software