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



A Review on role of Congestion Control Techniques in Internet of Things
Recent Advancement in Capsule: Emerging Novel Technologies and Alternative Shell Materials for Wide Range of Therapeutic Needs
Effect of L-Dopa on cypermethrin induced reproductive conditions in female Japanese quail, Coturnix coturnix japonica
Preparation, Characterization, and Applications of Albumin Serum-Based Nanoparticles
Study of developmental stages and morphometrics of Parthenium beetle in Bastar plateau agro-climatic zone of Chhattisgarh
PANI Incorporated Fe-MOF: As an Electrode Material for Supercapacitor
Surface Modified Magnetic Nanoparticles as an Efficient Material for Wastewater Remediation: A Review
A Review on Groundwater Pollution in India and their Health Problems
Incidence of Chronic fever in Raigarh Development Block of Raigarh District, Chhattisgarh, India
Study the optimization of Dijkstra’s Algorithm

Tags


Recomonded Articles:

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

DOI:         Access: Open Access Read More