Sparse Approximations with Interior Point Methods
SIAM Review, 2022 Large-scale optimization problems that seek sparse solutions have become ubiquitous. They are routinely solved with various specialized first-order methods. Although such methods are often fast, they usually struggle with not-so-well conditioned problems.
Valentina De Simone +4 more
openaire +5 more sources
Solving the continuous nonlinear resource allocation problem with an interior point method
, 2013 Resource allocation problems are usually solved with specialized methods exploiting their general sparsity and problem-specific algebraic structure. We show that the sparsity structure alone yields a closed-form Newton search direction for the generic ...
Rohal, James J., Wright, Stephen E.
core +1 more source
Noise-Based Frequency Spectrum Correction Method Using Interior Point Approach
IEEE AccessThe spectral correction of noisy real sinusoidal signals is of critical importance; however, the presence of spectral leakage and noise introduces significant challenges.
Guichun Yang +6 more
doaj +1 more source
A predictor-corrector path-following algorithm for symmetric optimization based on Darvay's technique [PDF]
Yugoslav Journal of Operations Research, 2014 In this paper, we present a predictor-corrector path-following interior-point algorithm for symmetric cone optimization based on Darvay's technique.
Kheirfam Behrouz
doaj +1 more source
In situ molecular organization and heterogeneity of the Legionella Dot/Icm T4SS
FEBS Letters, EarlyView.We present a nearly complete in situ model of the Legionella Dot/Icm type IV secretion system, revealing its central secretion channel and identifying new components. Using cryo‐electron tomography with AI‐based modeling, our work highlights the structure, variability, and mechanism of this complex nanomachine, advancing understanding of bacterial ...
Przemysław Dutka +11 more
wiley +1 more source
Improving complexity of Karmarkar's approach for linear programming
Journal of Numerical Analysis and Approximation Theory, 2014 In this paper, we are interested in the performance of Karmarkar's projective algorithm for linear programming. Based on the work of Schrijver, we offer a new displacement step better than Schrijver's one which led to a moderate improvement in the ...
Djamel Benterki, Mousaab Bouafia
doaj +2 more sources
AN INTERIOR-POINT METHOD FOR MPECs BASED ON STRICTLY FEASIBLE RELAXATIONS. [PDF]
, 2004 An interior-point method for solving mathematical programs with equilibrium constraints (MPECs) is proposed. At each iteration of the algorithm, a single primaldual step is computed from each subproblem of a sequence.
Angel Víctor de Miguel +3 more
core +4 more sources
Cell wall target fragment discovery using a low‐cost, minimal fragment library
FEBS Letters, EarlyView.LoCoFrag100 is a fragment library made up of 100 different compounds. Similarity between the fragments is minimized and 10 different fragments are mixed into a single cocktail, which is soaked to protein crystals. These crystals are analysed by X‐ray crystallography, revealing the binding modes of the bound fragment ligands.
Kaizhou Yan +5 more
wiley +1 more source
Modified Interior-Point Method for Large-and-Sparse Low-Rank Semidefinite Programs
, 2017 Semidefinite programs (SDPs) are powerful theoretical tools that have been studied for over two decades, but their practical use remains limited due to computational difficulties in solving large-scale, realistic-sized problems.
Lavaei, Javad, Zhang, Richard Y.
core +1 more source
Solving Large-Scale Optimization Problems Related to Bell's Theorem [PDF]
, 2014 Impossibility of finding local realistic models for quantum correlations due to entanglement is an important fact in foundations of quantum physics, gaining now new applications in quantum information theory.
Altman +24 more
core +2 more sources