Pages that link to "Item:Q868454"

The following pages link to Globally convergent limited memory bundle method for large-scale nonsmooth optimization (Q868454):

Displaying 49 items.

• A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations (Q255074) (← links)
• A bundle method using two polyhedral approximations of the \(\epsilon \)-enlargement of a maximal monotone operator (Q276854) (← links)
• Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (Q285034) (← links)
• An ODE-like nonmonotone method for nonsmooth convex optimization (Q330379) (← links)
• Subgradient method for nonconvex nonsmooth optimization (Q353174) (← links)
• Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality (Q480827) (← links)
• Constrained nonconvex nonsmooth optimization via proximal bundle method (Q481058) (← links)
• Diagonal bundle method for nonsmooth sparse optimization (Q495735) (← links)
• A quasisecant method for solving a system of nonsmooth equations (Q524563) (← links)
• Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems (Q727242) (← links)
• An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions (Q1665008) (← 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)
• An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems (Q1717575) (← links)
• A convergence analysis of the method of codifferential descent (Q1756589) (← links)
• Generalized order-value optimization (Q1935880) (← links)
• Conjugate gradient type methods for the nondifferentiable convex minimization (Q1941196) (← links)
• Aggregate subgradient method for nonsmooth DC optimization (Q1996741) (← links)
• A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration (Q2068018) (← links)
• Clusterwise support vector linear regression (Q2189912) (← links)
• Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions (Q2315256) (← links)
• A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems (Q2342127) (← links)
• Aggregate codifferential method for nonsmooth DC optimization (Q2349678) (← links)
• Numerical infinitesimals in a variable metric method for convex nonsmooth optimization (Q2422878) (← links)
• Limited memory interior point bundle method for large inequality constrained nonsmooth minimization (Q2425996) (← 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)
• Comparing different nonsmooth minimization methods and software (Q2885467) (← links)
• Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization (Q3145057) (← links)
• An extension of the quasi-Newton method for minimizing locally Lipschitz functions (Q3389584) (← 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)
• Concurrent processing of mixed‐integer non‐linear programming problems (Q4932950) (← links)
• Solving generalized inverse eigenvalue problems via L-BFGS-B method (Q4991546) (← links)
• Weak subgradient method for solving nonsmooth nonconvex optimization problems (Q5009157) (← links)
• An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space (Q5193505) (← links)
• A splitting bundle approach for non-smooth non-convex minimization (Q5248228) (← links)
• A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles (Q5268896) (← links)
• Minimization of marginal functions in mathematical programming based on continuous outer subdifferentials (Q5745159) (← links)
• Essentials of numerical nonsmooth optimization (Q5918756) (← links)
• Essentials of numerical nonsmooth optimization (Q5970841) (← links)
• A gradient sampling algorithm for stratified maps with applications to topological data analysis (Q6052059) (← links)
• A hierarchy of spectral relaxations for polynomial optimization (Q6062883) (← links)
• A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems (Q6173956) (← links)
• Exploiting constant trace property in large-scale polynomial optimization (Q6599981) (← 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)
• Implementation of an oracle-structured bundle method for distributed optimization (Q6640181) (← links)