Globally convergent limited memory bundle method for large-scale nonsmooth optimization
From MaRDI portal
Recommendations
- Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis
- New limited memory bundle method for large-scale nonsmooth optimization
- Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
Cites work
- scientific article; zbMATH DE number 3846333 (Why is no real title available?)
- scientific article; zbMATH DE number 53965 (Why is no real title available?)
- scientific article; zbMATH DE number 193188 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- scientific article; zbMATH DE number 726504 (Why is no real title available?)
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- scientific article; zbMATH DE number 1984254 (Why is no real title available?)
- scientific article; zbMATH DE number 2042672 (Why is no real title available?)
- scientific article; zbMATH DE number 4119958 (Why is no real title available?)
- scientific article; zbMATH DE number 789395 (Why is no real title available?)
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- Benchmarking optimization software with performance profiles.
- Bundle methods in stochastic optimal power management: A disaggregated approach using preconditioners
- Comparing nonsmooth nonconvex bundle methods in solving hemivariational inequalities
- Comparison of formulations and solution methods for image restoration problems
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- Methods of descent for nondifferentiable optimization
- New limited memory bundle method for large-scale nonsmooth optimization
- Nonconvex optimization in mechanics. Algorithms, heuristics and engineering applications by the F. E. M
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- On the limited memory BFGS method for large scale optimization
- Optimization and nonsmooth analysis
- Optimization of upper semidifferentiable functions
- Representations of quasi-Newton matrices and their use in limited memory methods
- Some numerical experiments with variable-storage quasi-Newton algorithms
- Survey of Bundle Methods for Nonsmooth Optimization
- Updating Quasi-Newton Matrices with Limited Storage
Cited in
(52)- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- Essentials of numerical nonsmooth optimization
- An extension of the quasi-Newton method for minimizing locally Lipschitz functions
- A bundle method using two polyhedral approximations of the -enlargement of a maximal monotone operator
- Aggregate subgradient method for nonsmooth DC optimization
- Combination of steepest descent and BFGS methods for nonconvex 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
- Numerical infinitesimals in a variable metric method for convex nonsmooth optimization
- A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
- Non-smooth optimization based on resilient backpropagation search for unconstrained and simply bounded problems
- A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization
- Essentials of numerical nonsmooth optimization
- Concurrent processing of mixed-integer non-linear programming problems
- Exploiting constant trace property in large-scale polynomial optimization
- A convergence analysis of the method of codifferential descent
- A gradient sampling algorithm for stratified maps with applications to topological data analysis
- Subgradient and bundle methods for nonsmooth optimization
- An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space
- Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
- A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration
- Aggregate codifferential method for nonsmooth DC optimization
- Generalized order-value optimization
- An ODE-like nonmonotone method for nonsmooth convex optimization
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization
- New limited memory bundle method for large-scale nonsmooth optimization
- An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions
- A hierarchy of spectral relaxations for polynomial optimization
- Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality
- Lagrangian relaxation for continuous-time optimal control of coupled hydrothermal power systems including storage capacity and a cascade of hydropower systems with time delays
- Comparing different nonsmooth minimization methods and software
- Constrained nonconvex nonsmooth optimization via proximal bundle method
- Implementation of an oracle-structured bundle method for distributed optimization
- Subgradient method for nonconvex nonsmooth optimization
- Limited-memory common-directions method for large-scale optimization: convergence, parallelization, and distributed optimization
- A splitting bundle approach for non-smooth non-convex minimization
- Solving generalized inverse eigenvalue problems via L-BFGS-B method
- Diagonal bundle method for nonsmooth sparse optimization
- Minimization of marginal functions in mathematical programming based on continuous outer subdifferentials
- New diagonal bundle method for clustering problems in large data sets
- Clusterwise support vector linear regression
- Weak subgradient method for solving nonsmooth nonconvex optimization problems
- Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis
- Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
- Conjugate gradient type methods for the nondifferentiable convex minimization
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
- A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
- A quasisecant method for solving a system of nonsmooth equations
- A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
This page was built for publication: Globally convergent limited memory bundle method for large-scale nonsmooth optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868454)
