Interior-point methods
Interior-point methods (also referred to as barrier methods or IPMs) are a certain class of algorithms that solve linear and nonlinear convex optimization problems. It enabled solutions of linear programming problems that were beyond the capabilities of the simplex method. Contrary to the simplex method, it reaches the best solution by traversing the interior of the feasible region. The method can be generalized to convex programming based on a self-concordant barrier function used to encode the convex set. The class of primal-dual path-following interior-point methods is considered the most successful. Mehrotra's predictor-corrector algorithm provides the basis for most implementations of this class of methods.
Date and Time
Location
Hosts
Registration
-
Add Event to Calendar
- Capital University of Science & Technology (CUST)
- Islamabad, Islamabad Capital Territory
- Pakistan
- Contact Event Host
- Co-sponsored by Control and Signal Processing Research Group
Speakers
Mr. Zohaib Latif of Electrical Engineering Department, CUST, Islamabad
Interior-point Methods
Biography:
PhD Scholar, Electrical Engineering