Pages that link to "Item:Q4806340"

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

Displaying 50 items.

• A bundle method using two polyhedral approximations of the \(\epsilon \)-enlargement of a maximal monotone operator (Q276854) (← links)
• A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process (Q299834) (← links)
• An optimal variant of Kelley's cutting-plane method (Q344947) (← links)
• Non-smooth predictive control for mechanical transmission systems with backlash-like hysteresis (Q345617) (← links)
• Unit commitment in oligopolistic markets by nonlinear mixed variable programming (Q374676) (← links)
• A new achievement scalarizing function based on parameterization in multiobjective optimization (Q421085) (← links)
• Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions (Q439450) (← links)
• On sensitivity analysis of nonsmooth multidisciplinary optimization problems in engineering process line applications (Q445463) (← links)
• Diagonal bundle method for nonsmooth sparse optimization (Q495735) (← links)
• Codifferential method for minimizing nonsmooth DC functions (Q539496) (← links)
• Nonsmooth exclusion test for finding all solutions of nonlinear equations (Q616162) (← links)
• An inexact spectral bundle method for convex quadratic semidefinite programming (Q694539) (← links)
• Convergence and computational analyses for some variable target value and subgradient deflection methods (Q853561) (← links)
• A trust region target value method for optimizing nondifferentiable Lagrangian duals of linear programs (Q857822) (← links)
• Globally convergent limited memory bundle method for large-scale nonsmooth optimization (Q868454) (← links)
• A bundle modification strategy for convex minimization (Q869143) (← links)
• A partially inexact bundle method for convex semi-infinite minmax problems (Q907208) (← links)
• On the computation of an element of Clarke generalized Jacobian for a vector-valued max function (Q1049060) (← links)
• Descent algorithm for nonsmooth stochastic multiobjective optimization (Q1687314) (← links)
• Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs (Q1730809) (← links)
• A fast gradient and function sampling method for finite-max functions (Q1756577) (← links)
• A convergence analysis of the method of codifferential descent (Q1756589) (← links)
• An effective adaptive trust region algorithm for nonsmooth minimization (Q1790684) (← links)
• A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming (Q1983659) (← links)
• A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization (Q1985287) (← links)
• On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems (Q2010091) (← links)
• Resource allocation for contingency planning: an inexact proximal bundle method for stochastic optimization (Q2030665) (← links)
• Randomized smoothing variance reduction method for large-scale non-smooth convex optimization (Q2033403) (← links)
• A new restricted memory level bundle method for constrained convex nonsmooth optimization (Q2080833) (← links)
• A multi-step doubly stabilized bundle method for nonsmooth convex optimization (Q2177698) (← links)
• Clusterwise support vector linear regression (Q2189912) (← links)
• Derivative-free optimization via proximal point methods (Q2250069) (← links)
• A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems (Q2342127) (← links)
• Tuning strategy for the proximity parameter in convex minimization (Q2370054) (← links)
• A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes (Q2399479) (← links)
• Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs (Q2423806) (← links)
• A new steepest descent differential inclusion-based method for solving general nonsmooth convex optimization problems (Q2442700) (← links)
• Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem (Q2482376) (← links)
• Spectral projected subgradient method for nonsmooth convex optimization problems (Q2700023) (← links)
• Reachability Analysis and Deterministic Global Optimization of DAE Models (Q2795640) (← links)
• A convex approach for NMPC based on second order Volterra series models (Q2795773) (← links)
• An implementation of a reduced subgradient method via Luenberger-Mokhtar variant (Q2817227) (← links)
• Diagonal discrete gradient bundle method for derivative free nonsmooth optimization (Q2817235) (← links)
• Subgradient and Bundle Methods for Nonsmooth Optimization (Q2838345) (← links)
• An analytical and numerical approach to a bilateral contact problem with nonmonotone friction (Q2872860) (← links)
• Comparing different nonsmooth minimization methods and software (Q2885467) (← links)
• A Support Function Based Algorithm for Optimization with Eigenvalue Constraints (Q2967609) (← links)
• 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)