Optimizing a Linearly Constrained Quadratic Programming Problem Using Eigen-Value Decomposition and Resultant Vector Ascent Method

This paper suggests an iterative method for optimizing a Quadratic Programming Problem, constrained with a set of Linear Inequalities (less than type), regardless of the nature of the square matrix ( B ) within the objective function. To reach the global solution the entire travel is devised with a...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	International journal of applied and computational mathematics Ročník 11; číslo 6; s. 231
Hlavní autor:	Sarkar, Subhadip
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New Delhi Springer India 01.12.2025 Springer Nature B.V
Témata:	Applications of Mathematics Approximation Computational Science and Engineering Constraints Eigenvalues Eigenvectors Iterative methods Linear functions Literature reviews Mathematical and Computational Physics Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Matrices (mathematics) Methods Nuclear Energy Operations Research/Decision Theory Optimization Original Paper Production planning Quadratic programming Resultants Slack variables Theoretical Variables Global optimal solution Resultant Vector Ascent Method Quadratic Programming Null space Eigen Value Decomposition
ISSN:	2349-5103, 2199-5796
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!