Abstract View

Author(s): Smita Gupta, N.S. Chaudhari

Email(s): Email ID Not Available

Address: School of Computer Science, Devi Ahilya University, Indore - 452 001

Published In:   Volume - 11,      Issue - 1,     Year - 1998

DOI: Not Available

ABSTRACT:
This paper discusses a path-following infeasible-interior-point algorithm to solve convex quadratic programming problems. An experimental code has also been developed and some numerical results have been obtained by using the algorithm to solve several convex quadratic programming problems (COP).

Cite this article:
Gupta and Chaudhari (1998). A Path-Following Infeasible-Interior-Point Algorithm to Solve Convex Quadratic Programming Problems. Journal of Ravishankar University (Part-B: Science), 11(1), pp.17-23.


References not available.

Related Images:



Recent Images



OLED: New Generation Display Technology
Parametric study of AlGAN/GaN UV-Led Based on Quantum Confined Stark Effect (QCSE)
Analysis of High Efficient Perovskite Solar Cells Using Machine Learning
Inverted Bulk Heterojunction (BHJ) Polymer (PCDTBT-PC70BM) Solar Photovoltaic Technology
Design and Device Modeling of Lead Free CsSnI3 Perovskite Solar Cell
Study of Design and Device Modeling of Double layered Perovskite Solar Cells
Screening Some Extracellular Enzymes of Wild Mushrooms from Pt. Ravishankar Shukla University Campus
Quantum Dots and Nanohybrids and their Various Applications: A Review
Species of Termitomyces (Agaricales) Occurring in Achanakmar Biosphere Reserve, Chhattisgarh
Introduction to Cloud Storage Services

Tags


Recomonded Articles:

Author(s): Smita Gupta; N.S. Chaudhari

DOI:         Access: Open Access Read More