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



Recent Advances and Applications of Nanobiotechnology: A Comprehensive Review
The imperious traditional medicinal plants in the treatment of jaundice from Kosgi mandal, Naryanapet Dist. Telangana State
Nanostructured Lipid Carrier-Based Nanoformulations for Atopic Dermatitis: A Comprehensive Review
Formulation, Development & Characterization of Nanostructured Lipid Carrier Loaded Topical Gel for Atopic Dermatitis
Fluoride Contamination in Water of Balrampur District and its Effects on Human Health
Review on Iron Contamination in Water of Dhamtari District and its Effects on Human Health
Floristic and Ethnobotanical Study of Tikhur (Curcuma angustifolia Roxb.) in Gariaband District, Chhattisgarh
Floristic Study and Ecological Importance of Selaginella spp. (Little Club Moss) in Chhura Block of Gariaband District, Chhattisgarh, India
Study of Physio- Chemical Parameter of Kharun River and Concentration of Heavy Metal (Iron)
Nutritional Analysis of DrakshadiGhritafor Management of Karshya

Tags


Recomonded Articles:

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

DOI:         Access: Open Access Read More