Bayesian augmented Lagrangian algorithm for system identification
نویسندگان
چکیده
منابع مشابه
A Fast Augmented Lagrangian Algorithm for Learning Low-Rank Matrices
We propose a general and efficient algorithm for learning low-rank matrices. The proposed algorithm converges super-linearly and can keep the matrix to be learned in a compact factorized representation without the need of specifying the rank beforehand. Moreover, we show that the framework can be easily generalized to the problem of learning multiple matrices and general spectral regularization...
متن کاملAn Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization
This paper is about distributed derivative-based algorithms for solving optimization problems with a separable (potentially nonconvex) objective function and coupled affine constraints. A parallelizable method is proposed that combines ideas from the fields of sequential quadratic programming and augmented Lagrangian algorithms. The method negotiates shared dual variables that may be interprete...
متن کاملAn Augmented Lagrangian Algorithm for Solving Semiinfinite Programming
We present a smooth augmented Lagrangian algorithm for semiinfinite programming SIP . For this algorithm, we establish a perturbation theorem under mild conditions. As a corollary of the perturbation theorem, we obtain the global convergence result, that is, any accumulation point of the sequence generated by the algorithm is the solution of SIP.We get this global convergence result without any...
متن کاملElectromagnetism-like Augmented Lagrangian Algorithm for Global Optimization
This paper presents an augmented Lagrangian algorithm to solve continuous constrained global optimization problems. The algorithm approximately solves a sequence of bound constrained subproblems whose objective function penalizes equality and inequality constraints violation and depends on the Lagrange multiplier vectors and a penalty parameter. Each subproblem is solved by a population-based m...
متن کاملCombining stabilized SQP with the augmented Lagrangian algorithm
For an optimization problem with general equality and inequality constraints, we propose an algorithm which uses subproblems of the stabilized SQP (sSQP) type for approximately solving subproblems of the augmented Lagrangian method. The motivation is to take advantage of the well-known robust behavior of the augmented Lagrangian algorithm, including on problems with degenerate constraints, and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Systems & Control Letters
سال: 2018
ISSN: 0167-6911
DOI: 10.1016/j.sysconle.2018.07.011