• PESTO

  • Referenced in 30 articles [sw20864]
  • instances of optimization problems on which the algorithm reaches this worst-case. We achieve this ... obtain a tighter analysis of the proximal point algorithm and of several variants of fast ... analytical worst-case guarantee for the proximal point algorithm that is twice better than previously ... extended by incorporating a projection or a proximal operator, which leads to an algorithm that...
  • IMRO

  • Referenced in 8 articles [sw20465]
  • effectively recover the proximal point. The algorithm is applied to $ell_1$-regularized least squares...
  • FBstab

  • Referenced in 1 article [sw33418]
  • quadratic programming that synergistically combines the proximal point algorithm with a primal-dual semismooth Newton...
  • McIPM

  • Referenced in 11 articles [sw07097]
  • implementing self-regular proximity based feasible IPMs. Self-regular based interior point methods present ... After a brief review of the underlying algorithm, various issues with respect to implementation ... Self-Regular proximity based approach allows to improve the performance of interior point method software...
  • proxdist

  • Referenced in 2 articles [sw29698]
  • distance algorithms: theory and practice. .. The proximal distance algorithm in each case is competitive ... traditional methods such as the interior point method and the alternating direction method of multipliers...
  • Tick

  • Referenced in 6 articles [sw26586]
  • emphasis on time-dependent models, such as point processes, and tools for generalized linear models ... module providing model computational classes, solvers and proximal operators for regularization. tick relies ... implementation and state-of-the-art optimization algorithms to provide very fast computations...
  • QPALM

  • Referenced in 2 articles [sw35397]
  • shown to be equivalent to inexact proximal point iterations on the extended-real-valued cost ... convergence of such iterations to a stationary point at an R-linear rate ... possibly nonconvex) QP. The QPALM algorithm solves the subproblems iteratively using semismooth Newton directions...
  • BlockPDPS.jl

  • Referenced in 3 articles [sw39173]
  • develop block structure-adapted primal-dual algorithms for non-convex non-smooth optimisation problems, whose ... refinements of the nonlinear primal-dual proximal splitting method for such problems without the block ... itself is based on the primal-dual proximal splitting method of Chambolle and Pock ... distance of the iterates to a critical point, we show local...
  • IQC-Game

  • Referenced in 1 article [sw39462]
  • derive sharper bounds for the proximal point method (PPM) and optimistic gradient method ... impact of multiplicative noise on different algorithms. We show that it is impossible...
  • AMD

  • Referenced in 55 articles [sw00039]
  • Algorithm 837: AMD is a set of routines...
  • ATLAS

  • Referenced in 197 articles [sw00056]
  • This paper describes the Automatically Tuned Linear Algebra...
  • BPMPD

  • Referenced in 40 articles [sw00088]
  • BPMPD is a state-of-the-art implementation...
  • GAP

  • Referenced in 2974 articles [sw00320]
  • GAP is a system for computational discrete algebra...
  • HSL

  • Referenced in 274 articles [sw00418]
  • HSL (formerly the Harwell Subroutine Library) is a...
  • ISOGAT

  • Referenced in 298 articles [sw00457]
  • A tutorial 2D MATLAB code for solving elliptic...
  • KNITRO

  • Referenced in 182 articles [sw00490]
  • KNITRO is a solver for nonlinear optimization. It...
  • LANCELOT

  • Referenced in 304 articles [sw00500]
  • LANCELOT. A Fortran package for large-scale nonlinear...
  • LAPACK

  • Referenced in 1649 articles [sw00503]
  • LAPACK is written in Fortran 90 and provides...
  • LDL

  • Referenced in 16 articles [sw00507]
  • Algorithm 849: A concise sparse Cholesky factorization package...
  • LEDA

  • Referenced in 261 articles [sw00509]
  • In the core computer science areas -- data structures...