Variable Projection for NonSmooth Problems

نویسندگان

چکیده

Variable projection solves structured optimization problems by completely minimizing over a subset of the variables while iterating remaining variables. Over past 30 years, technique has been widely used, with empirical and theoretical results demonstrating both greater efficacy stability compared to competing approaches. Classic examples have exploited closed-form projections smoothness objective function. We extend approach that include nonsmooth terms, develop an inexact adaptive algorithm subproblems inexactly iterative methods, analyze its computational complexity. Finally, we illustrate effectiveness numerical examples. Code reproduce is available at https://github.com/TristanvanLeeuwen/VarProNS.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Variable projection for nonlinear least squares problems

The variable projection algorithm of Golub and Pereyra (1973) has proven to be quite valuable in the solution of nonlinear least squares problems in which a substantial number of the parameters are linear. Its advantages are efficiency and, more importantly, a better likelihood of finding a global minimizer rather than a local one. The purpose of our work is to provide a more robust implementat...

متن کامل

Benson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality

‎In this paper‎, ‎we propose an algorithm to obtain an approximation set of the (weakly) nondominated points of nonsmooth multiobjective optimization problems with equality and inequality constraints‎. ‎We use an extension of the Wolfe duality to construct the separating hyperplane in Benson's outer algorithm for multiobjective programming problems with subdifferentiable functions‎. ‎We also fo...

متن کامل

Multigrid method for nonsmooth problems

Multigrid methods have been shown to be an efficient tool for solving partial differential equations. In this paper, the idea of a multigrid method for nonsmooth problems is presented based on techniques from piecewise linear differentiation. In detail, the original nonsmooth problem is approximated by a sequence of piecewise linear models, which can be written in abs-normal form by using addit...

متن کامل

Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints

We present a random perturbation of the projected variable metric method for solving linearly constrained nonsmooth (i.e., nondifferentiable) nonconvex optimization problems, and we establish the convergence to a global minimum for a locally Lipschitz continuous objective function which may be nondifferentiable on a countable set of points. Numerical results show the effectiveness of the propos...

متن کامل

Incremental Constraint Projection-Proximal Methods for Nonsmooth Convex Optimization

We consider convex optimization problems with structures that are suitable for stochastic sampling. In particular, we focus on problems where the objective function is an expected value or is a sum of a large number of component functions, and the constraint set is the intersection of a large number of simpler sets. We propose an algorithmic framework for projection-proximal methods using rando...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Scientific Computing

سال: 2021

ISSN: ['1095-7197', '1064-8275']

DOI: https://doi.org/10.1137/20m1348650