• Wirtinger Flow

  • Referenced in 110 articles [sw34175]
  • linear system). This paper develops a non-convex formulation of the phase retrieval problem ... applying novel update rules, which have low computational complexity, much like in a gradient descent ... scheme is efficient both in terms of computational and data resources. In theory, a variation ... data. Underlying our analysis are insights for the analysis of non-convex optimization schemes that...
  • CCA

  • Referenced in 5 articles [sw30994]
  • Computational convex analysis library. The Computational Convex Analysis numerical library contains efficient algorithms to manipulate ... nonconvex univariate functions, and to compute fundamental convex analysis transforms. Functions can be entered explicitly...
  • CGAL

  • Referenced in 394 articles [sw00118]
  • projects using CGAL web page. The Computational Geometry Algorithms Library (CGAL), offers data structures ... approximation of ridges and umbilics), alpha shapes, convex hull algorithms ... neighbor interpolation and placement of streamlines), shape analysis, fitting, and distances (smallest enclosing sphere...
  • SCAT

  • Referenced in 9 articles [sw25392]
  • Symbolic Convex Analysis Toolkit (SCAT) is a Maple package for symbolic computation of various objects...
  • libMC

  • Referenced in 47 articles [sw06615]
  • convex and concave relaxations recursively for each of these intermediate variables via interval analysis ... opposed to gradients) need to be computed. This can be done in either ... forward mode, with each elementary operation of convex and concave relaxation, additional variables are introduced...
  • flexclust

  • Referenced in 27 articles [sw04583]
  • centroids cluster analysis supporting arbitrary distance measures and centroid computation. Further cluster methods include hard ... graphs, convex cluster hulls, barcharts of centroids, ...), and bootstrap methods for the analysis of cluster...
  • iPiano

  • Referenced in 60 articles [sw09623]
  • differentiable (possibly nonconvex) and a convex (possibly nondifferentiable) function. The algorithm iPiano combines forward-backward ... Heavy-ball method from Polyak. A rigorous analysis of the algorithm for the proposed class ... general problem class. We demonstrate iPiano on computer vision problems – image denoising with learned priors...
  • PESTO

  • Referenced in 36 articles [sw20864]
  • reducing the computation of the worst-case to solving a convex semidefinite program, generalizing previous ... these developments to obtain a tighter analysis of the proximal point algorithm and of several...
  • LPbook

  • Referenced in 51 articles [sw31782]
  • proceeding to convex analysis, network flows, integer programming, quadratic programming, and convex optimization. The book ... optimization: to solve practical problems on a computer. Accordingly, the book is coordinated with free...
  • AK-MCS

  • Referenced in 67 articles [sw18303]
  • computations. Metamodels are used to reduce these computation times. To assess reliability, the most popular ... originated from geostatistics, have emerged in reliability analysis. Widespread in optimisation, Kriging has just started ... with high non-linearity, non-differentiability, non-convex and non-connex domains of failure...
  • IRIT

  • Referenced in 6 articles [sw21528]
  • symbolic, numeric and algebraic based computation and analysis, support of trivariate spline volumes, as well ... unique computational abilities such as extensive bisector computation for curves and surfaces, convex hulls ... distance analysis, kinematics analysis over freeforms, wire EDM and multi-axis CNC analysis for freeform ... implicit forms. A rich set of computational geometry tools for freeform splines is offered including...
  • SOFAR

  • Referenced in 7 articles [sw31665]
  • spare vector autoregression analysis. Exploiting the framework of convexity-assisted nonconvex optimization, we derive nonasymptotic ... efficient SOFAR algorithm with convergence property. Both computational and theoretical advantages of our procedure...
  • Karnak.sGbem

  • Referenced in 3 articles [sw10250]
  • performed in a canonical form as a convex optimization problem with quadratic constraints, in terms ... numerical tests, compared with the iterative elastoplastic analysis via the Multidomain Symmetric Galerkin Boundary Element ... with the available literature, prove the computational advantages of the proposed algorithm...
  • APPLE

  • Referenced in 4 articles [sw13354]
  • penalized likelihood estimators. In high-dimensional data analysis, penalized likelihood estimators are shown to provide ... Approximate Path for Penalized Likelihood Estimators. Both convex penalties (such as LASSO) and folded concave ... such as MCP) are considered. APPLE efficiently computes the solution path for the penalized likelihood ... several well-known packages via simulation and analysis of two gene expression data sets...
  • SPeeDI

  • Referenced in 8 articles [sw00896]
  • computational procedures resort to (forward or backward) propagation of constraints, typically (unions of convex) polyhedra ... specific (class of) systems under analysis. An interesting and still decidable class of hybrid system...
  • convex_learning

  • Referenced in 4 articles [sw32735]
  • semi-convex variant is included in the analysis and the experiments of the paper ... continuous setting. Exploiting convexity, globally optimal solutions are further computed numerically for applications with incomplete...
  • ExtraPush

  • Referenced in 5 articles [sw28495]
  • algorithm ExtraPush for consensus optimization with convex differentiable objective functions over a directed network. When ... stationary distribution of the network can be computed in advance, we propose a simplified algorithm ... diminishing step sizes. We present preliminary analysis for ExtraPush under a bounded sequence assumption ... provided that the objective function is strongly convex. In our numerical experiments, ExtraPush and Normalized...
  • pylearn-simulate

  • Referenced in 1 article [sw26392]
  • smooth convex minimization. With recently developed methods it is possible to perform an analysis ... which the computed model can be linked to a given structure of the data...
  • MDC-ELLIPSOIDs

  • Referenced in 11 articles [sw22577]
  • where the surfaces are in a convex-convex interaction and do not deform or alter ... originally developed to perform computational simulations for contact analysis of multibody systems. However, the proposed...
  • JuliaReach

  • Referenced in 3 articles [sw28217]
  • JuliaReach, a toolbox for set-based reachability analysis of dynamical systems. JuliaReach consists ... algorithms for calculus with convex sets. The library offers both concrete and lazy set representations ... stands for the ability to delay set computations until they are needed. The choice...