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



Chlorpyrifos Mediated Amendment in Protein Profiling of Bacillus spp.
Structural, Compositional and Photoluminescence Studies of Li4SrCa(SiO4)2: Eu3+ Red Phosphor Synthesized by Solid State Reaction Method
Formulation and Characterization of Magnetically Responsive Mesalamine Microspheres for Colon Targeting
Development of Non-Invasive Technique for Heart Rate Detection Using Facial Videos
Human Part Semantic Segmentation Using CDGNET Architecture for Human Activity Recognition
Lifestyle Modification Therapy and its Effect on Weight Status of Non-Alcoholic Male Liver Disease Patients
Exploring Life Cycle Analysis in Developing Sustainable Communities in Chhattisgarh
Monitoring the Concentration of Lead in the Industrial Wastewater of Baloda Bazar District
Impact of Climate Change on Paddy Yield in Bastar District of Chhattisgarh
Chemical Pollutants: A Concern to The Environment

Tags


Recomonded Articles:

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

DOI:         Access: Open Access Read More