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



Study of the Enhanced Efficiency of Crystalline Silicon Solar Cells by Optimizing Anti Reflecting Coating using PC1D Simulation
Formulation of Topical Itraconazole Nanostructured Lipid Carriers (Nlc) Gel for Onychomycosis
Cosmetic Testing Equipment: Device and Types of Equipment for Dermatological Evaluation for Women’s Skin
Oxidative stress: Insights into the Pathogenesis and Treatment of Alopecia
UV Spectroscopy Analysis for Itraconazole
Challenges and Potential of Perovskite Solar Cells
Kinetic Study of Solvent Effect on the Hydrolysis of  Mono-3, 5-Dimethylaniline Phosphate
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

Tags


Recomonded Articles:

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

DOI:         Access: Open Access Read More