Skip to search formSkip to main contentSkip to account menu

Self-concordant function

Known as: Self-concordant 
In optimization, a self-concordant function is a function for which A function is self-concordant if its restriction to any arbitrary line is self… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
In this paper, we study large-scale convex optimization algorithms based on the Newton method applied to regularized generalized… 
Highly Cited
2017
Highly Cited
2017
We consider the problem of linear regression where the $\ell_2^n$ norm loss (i.e., the usual least squares loss) is replaced by… 
2015
2015
Abstract Some individuals feel strong conviction and interest in pursuing personal goals, and minimal pressure and compulsion (i… 
2009
2009
The notion of self-concordant function on Euclidean spaces was introduced and studied by Nesterov and Nemirovsky (6). They have… 
2008
2008
We analyze the problem of finding a point strictly interior to a bounded, convex, and fully dimensional set from a finite… 
2006
2006
In this paper we develop a technique for constructing self-concordant barriers for convex cones. We start from a simple proof for… 
Highly Cited
2004
Highly Cited
2004
Abstract.We study homogeneous convex cones. We first characterize the extreme rays of such cones in the context of their primal… 
Highly Cited
2002
Highly Cited
2002
Abstract. We consider the Riemannian geometry defined on a convex set by the Hessian of a self-concordant barrier function, and… 
1998
1998
We present a definition of symmetric primal-dual algorithms for convex optimization problems expressed in the conic form. After…