Interior Point Methods for Nonlinear Optimization
By Imre Pólik, Tamás Terlaky. 2010
401 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Numerical Analysis
View Paper: https://www.semanticscholar.org/paper/7375fcc264678c275087bb927cd65529d9896258
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
In Numerical Analysis
Citations in the corpus
- RSS-Based Localization in Wireless Sensor Networks Using Convex Relaxation: Noncooperative and Cooperative Schemes (2015, methodology): “The proposed approach outperforms on average “SD/SOCP-1” by roughly 0.5 m, although “SD/SOCP-1” solves two SDP problems.”
- Secure Wireless Communication via Intelligent Reflecting Surface (2019, background): “…transformation [11], i.e., we set µ = 1 / [ tr ( G E S )+ h E +1] and X = µ S , and transform problem (21) into the following equivalent non-fractional form Problem (22) is a convex semidefinite programming (SDP) problem and thus can be optimally solved by using e.g. the interior-point method [12].”