LDGB
From MaRDI portal
Software:19189
No author found.
Related Items (46)
Comparing different nonsmooth minimization methods and software ⋮ Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis ⋮ A gradient sampling method based on ideal direction for solving nonsmooth optimization problems ⋮ A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems ⋮ A new trust region method for nonsmooth nonconvex optimization ⋮ A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions ⋮ Limited-memory BFGS with displacement aggregation ⋮ An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems ⋮ Introduction to Nonsmooth Optimization ⋮ Subgradient method for nonconvex nonsmooth optimization ⋮ Globally convergent limited memory bundle method for large-scale nonsmooth optimization ⋮ Composite proximal bundle method ⋮ Primal–dual accelerated gradient methods with small-dimensional relaxation oracle ⋮ A conjugate gradient sampling method for nonsmooth optimization ⋮ A simple version of bundle method with linear programming ⋮ An efficient conjugate gradient method with strong convergence properties for non-smooth optimization ⋮ Clusterwise support vector linear regression ⋮ Limited memory interior point bundle method for large inequality constrained nonsmooth minimization ⋮ New diagonal bundle method for clustering problems in large data sets ⋮ A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees ⋮ Solving dual problems using a coevolutionary optimization algorithm ⋮ A modified conjugate gradient method for general convex functions ⋮ A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization ⋮ Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization ⋮ Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality ⋮ Diagonal bundle method for nonsmooth sparse optimization ⋮ A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization ⋮ A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization ⋮ Aggregate subgradient method for nonsmooth DC optimization ⋮ A quasisecant method for solving a system of nonsmooth equations ⋮ An adaptive competitive penalty method for nonsmooth constrained optimization ⋮ A fast gradient and function sampling method for finite-max functions ⋮ A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs ⋮ Codifferential method for minimizing nonsmooth DC functions ⋮ Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization ⋮ A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions ⋮ Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization ⋮ Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems ⋮ A method for convex black-box integer global optimization ⋮ A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration ⋮ An algorithm for nonsmooth optimization by successive piecewise linearization ⋮ A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems ⋮ Subgradient and Bundle Methods for Nonsmooth Optimization ⋮ Efficient hybrid methods for global continuous optimization based on simulated annealing ⋮ Weak subgradient method for solving nonsmooth nonconvex optimization problems ⋮ A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
This page was built for software: LDGB
