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