An Active-Set Algorithm for Convex Quadratic Programming Subject to Box Constraints with Applications in Non-Linear Optimization and Machine Learning
A quadratic programming problem with positive definite Hessian subject to box constraints is solved, using an active-set approach. Convex quadratic programming (QP) problems with box constraints appear quite frequently in various real-world applications. The proposed method employs an active-set str...
Saved in:
| Main Authors: | Konstantinos Vogklis, Isaac E. Lagaris |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-04-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/13/9/1467 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Convex Formulations for Antenna Array Pattern Optimization Through Linear, Quadratic, and Second-Order Cone Programming
by: Álvaro F. Vaquero, et al.
Published: (2025-05-01) -
A Modified Augmented Lagrange Multiplier Method for Non-Linear Programming
by: Abbas Al-Bayati, et al.
Published: (2013-07-01) -
A NUMERICAL METHOD FOR SOLVING LINEAR–QUADRATIC CONTROL PROBLEMS WITH CONSTRAINTS
by: Mikhail I. Gusev, et al.
Published: (2016-12-01) -
Compactly convex sets in linear topological spaces
by: T. Banakh, et al.
Published: (2012-05-01) -
Neutrosophic augmented Lagrange multipliers method Nonlinear Programming Problems Constrained by Inequalities
by: Florentin Smarandache, et al.
Published: (2025-04-01)