Get started
Keyword

interior point methods

Description: A family of numerical optimization algorithms that approach solutions through the interior of a feasible region, used in linear and convex programming.
Wikidata ID: wiki/Q461992
OpenAlex ID: keywords/interior-point-methods
Convex Optimization
2004 · Stephen Boyd, Lieven Vandenberghe · Cambridge University Press eBooks · 56,561
Atomic Decomposition by Basis Pursuit
1998 · Scott Shaobing Chen, David L. Donoho, et al. · SIAM Journal on Scientific Computing · 6,845
Nonlinear programming: theory and algorithms
1993 · Computers & Operations Research · 5,779
Atomic Decomposition by Basis Pursuit
2001 · Scott Shaobing Chen, David L. Donoho, et al. · SIAM Review · 5,087
A new polynomial-time algorithm for linear programming
1984 · N. Karmarkar · COMBINATORICA · 4,831
Interior-Point Polynomial Algorithms in Convex Programming
1994 · Yurii Nesterov, Arkadii Nemirovskii · Society for Industrial and Applied Mathematics eBooks · 4,337
Semidefinite Programming
1996 · Lieven Vandenberghe, Stephen Boyd · SIAM Review · 4,122
Engineering Optimization Theory and Practice
2019 · Singiresu S Rao · Wiley eBooks · 3,581
Introductory Lectures on Convex Optimization: A Basic Course
2014 · Ю Е Нестеров · Medical Entomology and Zoology · 3,352
Numerical Recipes 3rd Edition: The Art of Scientific Computing
2007 · William H. Press, Saul A. Teukolsky, et al. · Cambridge University Press eBooks · 3,328
Graph Implementations for Nonsmooth Convex Programs
2007 · Michael C. Grant, Stephen P. Boyd · Lecture notes in control and information sciences · 2,744
Fast linear iterations for distributed averaging
2004 · Lin Xiao, Stephen Boyd · Systems & Control Letters · 2,734
Robust Convex Optimization
1998 · A. Ben-Tal, A. Nemirovski · Mathematics of Operations Research · 2,606
Quantile regression for longitudinal data
2004 · Roger Koenker · Journal of Multivariate Analysis · 2,186
PDF
An Interior-Point Method for Large-Scale -Regularized Least Squares
2007 · Seung-Jean Kim, K. Koh, et al. · IEEE Journal of Selected Topics in Signal Processing · 2,084
Polynomial algorithms in linear programming
1980 · L.G. Khachiyan · USSR Computational Mathematics and Mathematical Physics · 1,994
An Interior Point Algorithm for Large-Scale Nonlinear Programming
1999 · Richard H. Byrd, Mary E. Hribar, et al. · SIAM Journal on Optimization · 1,741
A trust region method based on interior point techniques for nonlinear programming
2000 · Richard H. Byrd, Jean Charles Gilbert, et al. · Mathematical Programming · 1,639
Computers and Chemical Engineering
2008 · Lorenz T. Biegler, Ví­ctor M. Zavala · 1,383
Convex Optimization: Algorithms and Complexity
2015 · Sébastien Bubeck · Foundations and Trends® in Machine Learning · 1,242
PDF
Efficient projections onto the l 1 -ball for learning in high dimensions
2008 · John Duchi, Shai Shalev-Shwartz, et al. · International Conference on Machine Learning · 1,184
A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems
1999 · Mary Ann Branch, Thomas F. Coleman, et al. · SIAM Journal on Scientific Computing · 1,087
A new polynomial-time algorithm for linear programming
1984 · N. Karmarkar · 1,082
PDF
An interior algorithm for nonlinear optimization that combines line search and trust region steps
2005 · R.A. Waltz, J.L. Morales, et al. · Mathematical Programming · 1,057
Interior Point Algorithms
1997 · Yinyu Ye · Wiley eBooks · 941
Works count: 11,930
Citation count: 297,200
Year
Topic
Type