Best ellipsoidal relaxation to solve a nonconvex problem
نویسندگان
چکیده
منابع مشابه
A Lagrangian Relaxation-based Algorithm to Solve a Home Health Care Routing Problem
Nowadays, a rapid growth in the rate of life expectancy can be seen especially in the developed countries. Accordingly, the population of elderlies has been increased. By another point of view, the number of hospitals, retirement homes along with medical staffs has not been grown with a same rate. Hence, Home Health Care (HHC) operations including a set of nurses and patients have been develope...
متن کاملIterative Schemes to Solve Nonconvex Variational Problems
In this paper, we present several algorithms of the projection type to solve a class of nonconvex variational problems.
متن کاملA Honey Bee Algorithm To Solve Quadratic Assignment Problem
Assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. In this study, we solve quadratic assignment problem (QAP), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. It should be noted that any facility must be assign to only one location. In this paper, first o...
متن کاملEllipsoidal Relaxation of Deformed Vesicles.
Theoretical analysis and experimental quantification on the ellipsoidal relaxation of vesicles are presented. The current work reveals the simplicity and universal aspects of this process. The Helfrich formula is shown to apply to the dynamic relaxation of moderate-to-high tension membranes, and a closed-form solution is derived which predicts the vesicle aspect ratio as a function of time. Sca...
متن کاملNonconvex Relaxation Approaches to Robust Matrix Recovery
Motivated by the recent developments of nonconvex penalties in sparsity modeling, we propose a nonconvex optimization model for handing the low-rank matrix recovery problem. Different from the famous robust principal component analysis (RPCA), we suggest recovering low-rank and sparse matrices via a nonconvex loss function and a nonconvex penalty. The advantage of the nonconvex approach lies in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2004
ISSN: 0377-0427
DOI: 10.1016/j.cam.2003.08.012