PBNCGC

swMATH6156MaRDI QIDQ18290FDOQ18290

Author name not available (Why is that?)

Cited In (22)

• A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
• An efficient descent method for locally Lipschitz multiobjective optimization problems
• An Approximation Scheme for Distributionally Robust Nonlinear Optimization
• Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems
• Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization
• An augmented subgradient method for minimizing nonsmooth DC functions
• Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
• Introduction to Nonsmooth Optimization
• Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization
• Finite convergence of an active signature method to local minima of piecewise linear functions
• A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
• Algorithmic differentiation for piecewise smooth functions: a case study for robust optimization
• 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
• Certificates of infeasibility via nonsmooth optimization
• Diagonal bundle method for nonsmooth sparse optimization
• Reverse propagation of McCormick relaxations
• An algorithm for nonsmooth optimization by successive piecewise linearization
• Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis
• Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming
• Differentiable McCormick relaxations

This page was built for software: PBNCGC