21.7k citations
- Centre National de la Recherche ScientifiqueFR1.6k papers
- European Organization for Nuclear ResearchCH1.5k papers
- Université Libre de BruxellesBE1.5k papers
- Vrije Universiteit BrusselBE1.4k papers
- RWTH Aachen UniversityDE1.4k papers
- Massachusetts Institute of TechnologyUS1.4k papers
- University of AntwerpBE1.4k papers
- Universität HamburgDE1.4k papers
- Rutherford Appleton LaboratoryGB1.4k papers
- Deutsches Elektronen-Synchrotron DESYDE1.4k papers
- University of WarsawPL1.4k papers
- Université de StrasbourgFR1.4k papers
12 papers · 2 filters
Path-Based Conditions for Local Network Identifiability -- Full Version
Antoine Legat, Julien M. Hendrickx
This work focuses on the generic identifiability of dynamical networks with partial excitation and measurement: a set of nodes are interconnected by transfer functions according to…
High-order methods beyond the classical complexity bounds, II: inexact high-order proximal-point methods with segment search
Masoud Ahookhosh, Yurii Nesterov
A bi-level optimization framework (BiOPT) was proposed in [3] for convex composite optimization, which is a generalization of bi-level unconstrained minimization framework (BLUM) g…
High-order methods beyond the classical complexity bounds, I: inexact high-order proximal-point methods
Masoud Ahookhosh, Yurii Nesterov
In this paper, we introduce a \textit{Bi-level OPTimization} (BiOPT) framework for minimizing the sum of two convex functions, where both can be nonsmooth. The BiOPT framework invo…
Gradient Methods with Memory
Yurii Nesterov, Mihai I. Florea
In this paper, we consider gradient methods for minimizing smooth convex functions, which employ the information obtained at the previous iterations in order to accelerate the conv…
Conic-Optimization Based Algorithms for Nonnegative Matrix Factorization
Valentin Leplat, Yurii Nesterov, Nicolas Gillis +1
Nonnegative matrix factorization is the following problem: given a nonnegative input matrix and a factorization rank , compute two nonnegative matrices, with columns…
A Riemannian rank-adaptive method for low-rank matrix completion
Bin Gao, P. -A. Absil
The low-rank matrix completion problem can be solved by Riemannian optimization on a fixed-rank manifold. However, a drawback of the known approaches is that the rank parameter has…