Comparing different nonsmooth minimization methods and software
From MaRDI portal
Recommendations
Cites work
- 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 193559 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- A method of truncated codifferential with application to some problems of cluster analysis
- A quasisecant method for minimizing nonsmooth functions
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- An implementation of Shor's \(r\)-algorithm
- Benchmarking optimization software with performance profiles.
- Comparing nonsmooth nonconvex bundle methods in solving hemivariational inequalities
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
- Linear convergence of epsilon-subgradient descent methods for a class of convex functions
- Mathematical Programming for Data Mining: Formulations and Challenges
- Methods of descent for nondifferentiable optimization
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- New limited memory bundle method for large-scale nonsmooth optimization
- New variable-metric algorithms for nondifferentiable optimization problems
- Non-Euclidean restricted memory level method for large-scale convex 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
- Optimization and nonsmooth analysis
- Optimization of upper semidifferentiable functions
- Proximity control in bundle methods for convex nondifferentiable minimization
- Representations of quasi-Newton matrices and their use in limited memory methods
- Robust Formulations for Training Multilayer Perceptrons
- Survey of Bundle Methods for Nonsmooth Optimization
- Synchronous approach in interactive multiobjective optimization
- Variants to the cutting plane approach for convex nondifferentiable optimization
Cited in
(25)- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- Implementation of novel methods of global and nonsmooth optimization: GANSO programming library
- Composite proximal bundle method
- A bundle method using two polyhedral approximations of the -enlargement of a maximal monotone operator
- An Approximation Scheme for Distributionally Robust Nonlinear Optimization
- Minimizing Piecewise-Concave Functions Over Polyhedra
- Limited memory bundle DC algorithm for sparse pairwise kernel learning
- A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems
- A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization
- A convergence analysis of the method of codifferential descent
- Subgradient and bundle methods for nonsmooth optimization
- Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization
- The chain rule for VU-decompositions of nonsmooth functions
- A Trust-region Method for Nonsmooth Nonconvex Optimization
- Aggregate codifferential method for nonsmooth DC 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
- A method for convex minimization based on translated first-order approximations
- A splitting bundle approach for non-smooth non-convex minimization
- Diagonal bundle method for nonsmooth sparse optimization
- A hybrid method combining genetic algorithm and Hooke-Jeeves method for constrained global optimization
- A nonsmooth trust-region method for locally Lipschitz functions with application to optimization problems constrained by variational inequalities
- Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
- An efficient conjugate gradient method with strong convergence properties for non-smooth optimization
This page was built for publication: Comparing different nonsmooth minimization methods and software
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2885467)
