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



Modeling of Abnormal Hysteresis in CsPbBr3 based Perovskite Solar Cells
Impact of Melatonin on Growth and Antioxidant Activity of Cicer arietinum L. Grown under Arsenic Stress
Assessment of Cymoxanil in Soil, Water and Vegetable Samples
Need of Gallium Recovery from Waste Samples: A Review
Higher Order Statistics Based Blind Steg analysis using Deep Learning
Covid-19 related School Closure Impact on School going Children & Adolescents of Raipur, Chhattisgarh
Determination of Pentachlorophenol in Environmental Samples by Spectrophotometry
Simple and Cost Effective Polymer Modified Gold Nanoparticles Based on Colorimetric Determination of L-Cysteine in Food Samples
Investigation on Design and Device Modeling of High Performance CH3NH3PbI3-xClx Perovskite Solar Cells
Remotely Sensed Image Based on Robust Segmentation and GIS System

Tags


Recomonded Articles:

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

DOI:         Access: Open Access Read More