• FPC_AS

  • Referenced in 57 articles [sw12218]
  • sparse reconstruction based on shrinkage, subspace optimization, and continuation. We propose a fast algorithm ... likely to be nonzero in an optimal solution. Restricting the decision variables x to this ... linear function of x. The resulting subspace problem, which involves the minimization of a smaller...
  • lobpcg.m

  • Referenced in 117 articles [sw24008]
  • more expensive global optimization method on the same generalized block Krylov subspace. We propose...
  • subplex

  • Referenced in 22 articles [sw04818]
  • SUBPLEX is a subspace-searching simplex method for the unconstrained optimization of general multivariate functions...
  • CONLIN

  • Referenced in 46 articles [sw14151]
  • this paper, a special purpose dual optimizer is proposed to solve the explicit subproblem generated ... sought in a sequence of dual subspaces of variable dimensionality. The primary dual problem ... quadratic subproblem is restricted to the current subspace of non zero dual variables, its dimensionality ... devised, that yields a highly reliable dual optimizer...
  • MSPAI

  • Referenced in 6 articles [sw11522]
  • thus optimize the preconditioner relative to certain subspaces. We demonstrate MSPAI’s qualities for iterative ... present such an implementation introducing two new optimization techniques: First, we avoid redundant calculations using...
  • CGIST

  • Referenced in 1 article [sw26995]
  • specially designed to implicitly perform subspace optimization using the conjugate gradient method. More details...
  • Rice Vector

  • Referenced in 2 articles [sw13923]
  • algorithms from linear algebra and optimization, including Krylov subspace methods and various relatives of Newton ... nonlinear equations and constrained and unconstrained optimization, may be expressed purely in terms of this...
  • Rice Vector Library

  • Referenced in 2 articles [sw20169]
  • algorithms from linear algebra and optimization, including Krylov subspace methods and various relatives of Newton ... nonlinear equations and constrained and unconstrained optimization, may be expressed purely in terms of this...
  • BLOOMP

  • Referenced in 20 articles [sw06454]
  • techniques of band exclusion (BE) and local optimization (LO) are proposed to deal with such ... algorithms, such as orthogonal matching pursuit (OMP), subspace pursuit (SP), iterative hard thresholding (IHT), basis ... BLOT and Lasso-BLOT with the optimized regularization parameter have the best performance...
  • SLMQN

  • Referenced in 2 articles [sw00879]
  • large-scale bound constrained nonlinear optimization. SLMQN is a subspace limited memory quasi-Newton algorithm...
  • SCS

  • Referenced in 21 articles [sw16632]
  • Splitting conic solver: Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding. We introduce ... nonzero point in the intersection of a subspace and a cone. This approach has several...
  • R-SATCHMO

  • Referenced in 3 articles [sw06620]
  • searches a subspace of that which I-SATCHMO does. R-SATCHMO is optimal...
  • ITE

  • Referenced in 4 articles [sw12811]
  • their immediate application in information theoretical optimization problems. ITE also includes a prototype application ... central problem class of signal processing, independent subspace analysis and its extensions...
  • PL-ranking

  • Referenced in 1 article [sw28415]
  • optimization framework. Motivated by the fact that optimizing the top of ranking is more applicable ... sample and learning a low-dimensional common subspace for multi-modal data. Concretely, there ... pairwise ranking loss constraint to optimize the top of ranking. Then, considering that the pairwise ... enhanced after mapping them into the common subspace. We design an efficient low-rank stochastic...
  • Active subspaces

  • Referenced in 2 articles [sw32976]
  • output quantity of interest. The active subspace is the span of particular directions ... dimension for parameter studies—such as optimization and integration—that are essential to engineering tasks ... uncertainty quantification. For more information on active subspaces, visit http://activesubspaces.org/ or purchase the book...
  • HSL_ea19

  • Referenced in 3 articles [sw06189]
  • paper investigates the properties of Lehmann’s optimal bounds for eigenvalues of Hermitian problems ... employed in the framework of a subspace iteration algorithm and is actually implemented...
  • trlib

  • Referenced in 1 article [sw17722]
  • Lanczos iterations for assembly of Krylov subspaces. A vector- and matrix-free reverse communication interface ... frequently arises in sequential methods for nonlinear optimization. In this implementation, we made an effort ... exact way by considering all invariant Krylov subspaces. We investigate the numerical performance of trlib...
  • Algorithm 961

  • Referenced in 2 articles [sw26807]
  • including linear-quadratic optimal control problems, H∞-optimization, certain multibody systems, and many other areas ... compute certain eigenvalues and/or corresponding deflating subspaces of these matrix pencils. Recently developed methods exploit...
  • RESCU

  • Referenced in 2 articles [sw18285]
  • exploit the fact that only a subspace spanning the occupied Kohn-Sham states is required ... avoided. Third, by judiciously analyzing and optimizing various parts of the procedure in RESCU...
  • ChASE

  • Referenced in 1 article [sw30514]
  • modern algorithm and library based on subspace iteration with polynomial acceleration. Novel to ChASE ... that enter in the filter and an optimization of the polynomial degree that further reduces...