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



Optimized Structural Design of G+7 Residential Buildings: A Modern Approach with ETABS
Quantitative Estimation of Piperine in Drakshadi Ghrita by HPTLC Method
Screening of phenolics and flavonoids using FTIR and UV-Vis: Antioxidant activity and HPLC quantification of gallic acid and ellagic acid
Carbon Dots in Biomedical Applications: A Review of Their Interaction with Serum Albumins, Antidepressant Agents, and Enzymatic Systems
Review on Solar Energy in India, Achievements (2021–2025), and Benefits of Solar Energy
Investigation on Groundwater Quality in Sukma Bastar District, Chhattisgarh
Implement of Dijkstra method in Village data management system for Optimal Route Calculation
Fiber Reinforced Concrete: Comparative Analysis of Helix Steel Fibers and Plain Steel Fibers in Structural Applications
Dynamic Geometrical Modeling and Computational Analysis of Multi-Bob Pendulum Wave Interference Systems
A Comparative Analysis of Inventory Models: Evaluating the Economic Order Quantity (EOQ) Model with Constant Demand versus Variable Demand Rates

Tags


Recomonded Articles:

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

DOI:         Access: Open Access Read More