Pages that link to "Item:Q1356052"

The following pages link to Variable metric bundle methods: From conceptual to implementable forms (Q1356052):

Displaying 50 items.

• A doubly stabilized bundle method for nonsmooth convex optimization (Q263188) (← 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)
• On Lipschitz optimization based on gray-box piecewise linearization (Q304252) (← links)
• An optimal variant of Kelley's cutting-plane method (Q344947) (← links)
• The proximal Chebychev center cutting plane algorithm for convex additive functions (Q359628) (← links)
• Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment (Q486936) (← links)
• On approximations with finite precision in bundle methods for nonsmooth optimization (Q597165) (← links)
• Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs (Q662860) (← links)
• An inexact spectral bundle method for convex quadratic semidefinite programming (Q694539) (← links)
• Divide to conquer: decomposition methods for energy optimization (Q715247) (← links)
• A bundle modification strategy for convex minimization (Q869143) (← links)
• Fast Moreau envelope computation I: Numerical algorithms (Q870763) (← links)
• An additive subfamily of enlargements of a maximally monotone operator (Q904307) (← links)
• Computing proximal points of nonconvex functions (Q959941) (← links)
• A bundle-filter method for nonsmooth convex constrained optimization (Q959944) (← links)
• Incremental-like bundle methods with application to energy planning (Q975362) (← links)
• A proximal cutting plane method using Chebychev center for nonsmooth convex optimization (Q1013976) (← links)
• Infeasible predictor-corrector interior-point method applied to image restoration in the presence of noise (Q1573984) (← links)
• Globally convergent BFGS method for nonsmooth convex optimization (Q1573986) (← links)
• Approximately solving multi-valued variational inequalities by using a projection and contraction algorithm (Q1681783) (← links)
• Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem (Q1752849) (← links)
• A feasible point method with bundle modification for nonsmooth convex constrained optimization (Q1753350) (← links)
• Globally convergent variable metric method for convex nonsmooth unconstrained minimization (Q1807687) (← links)
• Descentwise inexact proximal algorithms for smooth optimization (Q1935582) (← links)
• Visualization of the \(\varepsilon \)-subdifferential of piecewise linear-quadratic functions (Q2013149) (← links)
• An inexact restoration-nonsmooth algorithm with variable accuracy for stochastic nonsmooth convex optimization problems in machine learning and stochastic linear complementarity problems (Q2112678) (← links)
• The developments of proximal point algorithms (Q2158107) (← links)
• A multi-step doubly stabilized bundle method for nonsmooth convex optimization (Q2177698) (← links)
• Efficient first-order methods for convex minimization: a constructive approach (Q2205976) (← links)
• Multiplier stabilization applied to two-stage stochastic programs (Q2275276) (← links)
• An algorithm for nonsmooth optimization by successive piecewise linearization (Q2316623) (← links)
• A splitting algorithm for coupled system of primal-dual monotone inclusions (Q2342140) (← links)
• Computing proximal points of convex functions with inexact subgradients (Q2413568) (← links)
• Numerical infinitesimals in a variable metric method for convex nonsmooth optimization (Q2422878) (← links)
• The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
• Comparison of bundle and classical column generation (Q2476993) (← links)
• A primal-proximal heuristic applied to the French unit-commitment problem (Q2571007) (← links)
• A \(\mathcal{VU}\)-algorithm for convex minimization (Q2576737) (← links)
• A bundle-type algorithm for routing in telecommunication data networks (Q2655403) (← links)
• Spectral projected subgradient method for nonsmooth convex optimization problems (Q2700023) (← links)
• A quasi-Newton method for unconstrained non-smooth problems (Q2804871) (← links)
• Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming (Q2817246) (← links)
• A Variable Metric Extension of the Forward–Backward–Forward Algorithm for Monotone Operators (Q2854336) (← links)
• A method for non-differentiable optimization problems (Q2885584) (← links)
• Level bundle methods for oracles with on-demand accuracy (Q2926079) (← links)
• A method for nonsmooth optimization problems (Q3154803) (← links)
• On the global convergence of a nonmonotone proximal bundle method for convex nonsmooth minimization (Q3539791) (← links)
• Robust mid-term power generation management (Q3625233) (← links)
• DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS (Q4548051) (← links)