Pages that link to "Item:Q4806340"

The following pages link to Survey of Bundle Methods for Nonsmooth Optimization (Q4806340):

Displaying 36 items.

• Nonsmooth cryptanalysis, with an application to the stream cipher MICKEY (Q2999550) (← links)
• An Algorithm Using Trust Region Strategy for Minimization of a Nondifferentiable Function (Q3114592) (← 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)
• (Q3316093) (← links)
• An extension of the quasi-Newton method for minimizing locally Lipschitz functions (Q3389584) (← links)
• A vector forward mode of automatic differentiation for generalized derivative evaluation (Q3458838) (← links)
• Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming (Q4571882) (← links)
• A DIRECT SEARCH QUASI-NEWTON METHOD FOR NONSMOOTH UNCONSTRAINED OPTIMIZATION (Q4608945) (← links)
• Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization (Q4639123) (← links)
• A limited-memory quasi-Newton algorithm for bound-constrained non-smooth optimization (Q4646678) (← links)
• (Q4736096) (← links)
• Direct search nonsmooth constrained optimization via rounded ℓ₁ penalty functions (Q5038179) (← links)
• Generalized derivatives of computer programs (Q5038428) (← links)
• A Deep Learning Method for Elliptic Hemivariational Inequalities (Q5074898) (← links)
• Adaptive Bundle Methods for Nonlinear Robust Optimization (Q5106409) (← links)
• Smoothing quadratic regularization method for hemivariational inequalities (Q5151500) (← links)
• Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions (Q5162654) (← links)
• Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions (Q5203798) (← links)
• Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs (Q5231677) (← links)
• A splitting bundle approach for non-smooth non-convex minimization (Q5248228) (← links)
• New limited memory bundle method for large-scale nonsmooth optimization (Q5460656) (← links)
• On the generalization of ECP and OA methods to nonsmooth convex MINLP problems (Q5495574) (← links)
• The method of codifferential descent for convex and global piecewise affine optimization (Q5859002) (← links)
• Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems (Q5860819) (← links)
• A Trust-region Method for Nonsmooth Nonconvex Optimization (Q5881403) (← links)
• Essentials of numerical nonsmooth optimization (Q5918756) (← links)
• The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming (Q5964241) (← links)
• Essentials of numerical nonsmooth optimization (Q5970841) (← links)
• An indefinite proximal subgradient-based algorithm for nonsmooth composite optimization (Q6064035) (← links)
• Capacity reservation for humanitarian relief: a logic-based benders decomposition method with subgradient cut (Q6096622) (← links)
• An error estimate for bilateral contact problem with nonmonotone friction between two electroelastic bodies (Q6171002) (← links)
• Hierarchical distributed optimization of constraint-coupled convex and mixed-integer programs using approximations of the dual function (Q6491323) (← links)
• Linear convergence of the derivative-free proximal bundle method on convex nonsmooth functions, with application to the derivative-free \(\mathcal{VU}\)-algorithm (Q6564758) (← links)
• Constructing a subgradient from directional derivatives for functions of two variables (Q6566601) (← links)
• Lagrangian relaxation for continuous-time optimal control of coupled hydrothermal power systems including storage capacity and a cascade of hydropower systems with time delays (Q6631779) (← links)