11 papers · ranked by Valyu relevance
Stanley Osher, Howard Heaton, Samy Wu Fung
Title: Significance Many objective functions do not admit explicit formulas for their proximal operators. Moreover, these operators often cannot be estimated using exact gradients (e.g., when objectives are accessible via an oracle). In this work, we give a formula for accurately approximating proximal operators using…
Alfonso Landeros, Oscar Hernan Madrid Padilla, Hua Zhou, Kenneth Lange
'Kenneth Lange'] The current paper studies the problem of minimizing a loss f(x) subject to constraints of the form Dx ∈ S, where S is a closed set, convex or not, and D is a matrix that fuses parameters. Fusion constraints can capture smoothness, sparsity, or more general constraint patterns. To tackle this generic…
Omar M. Sleem, M.E. Ashour, N. S. Aybat, Constantino M. Lagoa
Sparsity finds applications in diverse areas such as statistics, machine learning, and signal processing. Computations over sparse structures are less complex compared to their dense counterparts and need less storage. This paper proposes a heuristic method for retrieving sparse approximate solutions of optimization…
Jan Schröder, Yair Censor, Philipp Süss, Karl-Heinz Küfer
Given a family of linear constraints and a linear objective function one can consider whether to apply a Linear Programming (LP) algorithm or use a Linear Superiorization (LinSup) algorithm on this data. In the LP methodology one aims at finding a point that fulfills the constraints and has the minimal value of the…
Junjie Xia, Hoang Van Phan, Luke Vistain, Mengjie Chen + 3 more
'Savaş Tay' 'Shihua Zhang'] Proximity sequencing (Prox-seq) simultaneously measures gene expression, protein expression and protein complexes on single cells. Using information from dual-antibody binding events, Prox-seq infers surface protein dimers at the single-cell level. Prox-seq provides multi-dimensional…
Stefania Bellavia, Jacek Gondzio, Margherita Porcelli
A new relaxed variant of interior point method for low-rank semidefinite programming problems is proposed in this paper. The method is a step outside of the usual interior point framework. In anticipation to converging to a low-rank primal solution, a special nearly low-rank form of all primal iterates is imposed. To…
Eranda Çela, Bettina Klinz, Stefan Lendl, Gerhard J. Woeginger + 1 more
'Lasse Wulf'] An instance of the NP-hard Quadratic Shortest Path Problem (QSPP) is called linearizable iff it is equivalent to an instance of the classic Shortest Path Problem (SPP) on the same input digraph. The linearization problem for the QSPP (LinQSPP) decides whether a given QSPP instance is linearizable and…
Calvin Kielas-Jensen, Venanzio Cichella, Thomas Berry, Isaac Kaminer + 3 more
'Claire Walton' 'Antonio Pascoal' 'Roberto Teti'] This paper presents a method for the generation of trajectories for autonomous system operations. The proposed method is based on the use of Bernstein polynomial approximations to transcribe infinite dimensional optimization problems into nonlinear programming problems.…
Salvador Pineda, Juan Miguel Morales, Asunción Jiménez-Cordero
The design of new strategies that exploit methods from machine learning to facilitate the resolution of challenging and large-scale mathematical optimization problems has recently become an avenue of prolific and promising research. In this paper, we propose a novel learning procedure to assist in the solution of a…
C.S. Elder, Minh Hoang, Mohsen Ferdosi, Carl Kingsford
The Turnpike problem aims to reconstruct a set of one-dimensional points from their unordered pairwise distances. Turnpike arises in biological applications such as molecular structure determination, genomic sequencing, tandem mass spectrometry, and molecular error-correcting codes. Under noisy observation of the…
Yaru Fu, Xiaoyu Jiang, Yanpeng Zheng, Zhaolin Jiang
We present two fast algorithms for finding the solution of the nonsingular lower Hessenberg quasi-Toeplitz linear system stem from Markov chain. And we confirm the complexity of these two algorithms is both O $n\log n$ based on the fact that a lower Hessenberg quasi-Toeplitz matrix can be written as the sum of a…