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



Distribution and Characteristics of Microplastics in Indian Water Bodies: Present Understanding and Future Challenges
Isolation and Characterization of Plant Growth Promoting Rhizo Bacteria (PGPR) from Banana Rhizosphere
An Inventory Optimization Model for Complex Systems with Imprecise Demand and Variable Holding Cost using AI Forecasting
Butea Monosperma (Lam.) Taub.,: A Blazing Tree
Nanotechnology-Enhanced Phytopharmaceuticals for Ocular Health
Analytical Identification Test and Characterization for Curcumin and Salicylic Acid
Analytical Standardization of Vasaguduchyadi Kvatha Churna Using Gallic Acid as a Phytomarker
Thermoluminescence Properties of UV-irradiated CaLa2ZnO5 Phosphor Doped with Sm3+
Low Noise Amplifier Design at GHz-Frequencies: A Review of Recent Advances and Challenges
Performance Evaluation of a Medium-Rise RCC Structure Designed Using STAAD.Pro and IS Standards

Tags


Recomonded Articles:

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

DOI:         Access: Open Access Read More