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



Herbal Alternatives for Oral Health:  Mechanistic Exploration with their Market Potential
Time of the Day Variability in Pit-Building Behavior of Antlion Larvae
A Comprehensive Review of a particular Skin Injury: Pathogenesis, triggers, and current Treatment Options
Enhanced antioxidant activity in Curcuma caesia Roxb. microrhizomes treated with silver nanoparticles
Studies on the Interaction of Imidazolium Ionic Liquids with Human Serum Albumin
Basic and Advanced Logical Concept Derived from Surface Enhanced Infrared Spectroscopy (SEIRS) as Sensing Probe for Analysis of Chemical Species: A Brief Review
Soil Erosion Risk Estimation by using Semi Empirical RUSLE model: A case study of Maniyari Basin, Chhattisgarh
An Estimator of Population Variance Using Multi-Auxiliary Information
Microemulsion as Novel Drug Delivery for Fungal Eye Infection
Potential of Bioactive Compounds for Atopic Dermatitis

Tags


Recomonded Articles:

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

DOI:         Access: Open Access Read More