Pages that link to "Item:Q5460656"
From MaRDI portal
The following pages link to New limited memory bundle method for large-scale nonsmooth optimization (Q5460656):
Displayed 50 items.
- LDGB (Q19189) (← links)
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations (Q255074) (← links)
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems (Q295480) (← links)
- Subgradient method for nonconvex nonsmooth optimization (Q353174) (← links)
- Composite proximal bundle method (Q359623) (← links)
- Nonsmooth optimization via quasi-Newton methods (Q378113) (← links)
- Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality (Q480827) (← links)
- Diagonal bundle method for nonsmooth sparse optimization (Q495735) (← links)
- A quasisecant method for solving a system of nonsmooth equations (Q524563) (← links)
- An adaptive competitive penalty method for nonsmooth constrained optimization (Q526728) (← links)
- Codifferential method for minimizing nonsmooth DC functions (Q539496) (← links)
- Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems (Q727242) (← links)
- A gradient sampling method based on ideal direction for solving nonsmooth optimization problems (Q831368) (← links)
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization (Q868454) (← links)
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees (Q903922) (← links)
- New diagonal bundle method for clustering problems in large data sets (Q1694910) (← links)
- A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization (Q1716990) (← links)
- A new smoothing conjugate gradient method for solving nonlinear nonsmooth complementarity problems (Q1736744) (← links)
- A fast gradient and function sampling method for finite-max functions (Q1756577) (← links)
- A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization (Q1985287) (← links)
- Aggregate subgradient method for nonsmooth DC optimization (Q1996741) (← links)
- A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions (Q2023656) (← links)
- A method for convex black-box integer global optimization (Q2045020) (← links)
- A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration (Q2068018) (← links)
- A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems (Q2069440) (← links)
- Limited-memory BFGS with displacement aggregation (Q2149548) (← links)
- An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems (Q2150773) (← links)
- A conjugate gradient sampling method for nonsmooth optimization (Q2174178) (← links)
- Clusterwise support vector linear regression (Q2189912) (← links)
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs (Q2252688) (← links)
- An algorithm for nonsmooth optimization by successive piecewise linearization (Q2316623) (← links)
- A simple version of bundle method with linear programming (Q2419511) (← links)
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization (Q2425996) (← links)
- Solving dual problems using a coevolutionary optimization algorithm (Q2434646) (← links)
- Piecewise partially separable functions and a derivative-free algorithm for large scale nonsmooth optimization (Q2501110) (← links)
- Efficient hybrid methods for global continuous optimization based on simulated annealing (Q2571196) (← links)
- A modified conjugate gradient method for general convex functions (Q2699981) (← links)
- Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization (Q2786335) (← links)
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization (Q2817235) (← links)
- Subgradient and Bundle Methods for Nonsmooth Optimization (Q2838345) (← links)
- Non-smooth optimization based on resilient backpropagation search for unconstrained and simply bounded problems (Q2867435) (← links)
- An adaptive gradient sampling algorithm for non-smooth optimization (Q2867436) (← links)
- Comparing different nonsmooth minimization methods and software (Q2885467) (← links)
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization (Q3145057) (← links)
- A new trust region method for nonsmooth nonconvex optimization (Q3177633) (← links)
- Influence of a neighborhood shape on the efficiency of continuous variable neighborhood search (Q3388795) (← links)
- Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization (Q4622889) (← links)
- A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization (Q4646678) (← links)
- Weak subgradient method for solving nonsmooth nonconvex optimization problems (Q5009157) (← links)
- An efficient conjugate gradient method with strong convergence properties for non-smooth optimization (Q5025110) (← links)