Pages that link to "Item:Q911994"
From MaRDI portal
The following pages link to Proximity control in bundle methods for convex nondifferentiable minimization (Q911994):
Displaying 50 items.
- On deviation measures in stochastic integer programming (Q2488193) (← links)
- Lagrangian smoothing heuristics for Max-cut (Q2491324) (← links)
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization (Q2515032) (← links)
- Efficient hybrid methods for global continuous optimization based on simulated annealing (Q2571196) (← links)
- A stochastic integer programming model for incorporating day-ahead trading of electricity into hydro-thermal unit commitment (Q2575245) (← links)
- Spectral bundle methods for non-convex maximum eigenvalue functions: first-order methods (Q2576741) (← links)
- Spectral bundle methods for non-convex maximum eigenvalue functions: second-order methods (Q2576742) (← links)
- Conditional value-at-risk in stochastic programs with mixed-integer recourse (Q2583132) (← links)
- The bundle scheme for solving arbitrary eigenvalue optimizations (Q2628175) (← links)
- A tilted cutting plane proximal bundle method for convex nondifferentiable optimization (Q2638937) (← links)
- A bundle-type algorithm for routing in telecommunication data networks (Q2655403) (← links)
- Lagrange dual bound computation for stochastic service network design (Q2672131) (← links)
- A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems (Q2694519) (← links)
- Integer set reduction for stochastic mixed-integer programming (Q2701423) (← links)
- A strongly convergent proximal bundle method for convex minimization in Hilbert spaces (Q2790873) (← links)
- A quasi-Newton method for unconstrained non-smooth problems (Q2804871) (← links)
- An implementation of a reduced subgradient method via Luenberger-Mokhtar variant (Q2817227) (← links)
- Subgradient and Bundle Methods for Nonsmooth Optimization (Q2838345) (← links)
- Comparing different nonsmooth minimization methods and software (Q2885467) (← links)
- A method for non-differentiable optimization problems (Q2885584) (← links)
- Level bundle methods for oracles with on-demand accuracy (Q2926079) (← links)
- Recent Progress in Two-stage Mixed-integer Stochastic Programming with Applications to Power Production Planning (Q2974324) (← links)
- Risk Aversion in Two-Stage Stochastic Integer Programming (Q3001274) (← links)
- A method for nonsmooth optimization problems (Q3154803) (← links)
- A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations (Q3188440) (← links)
- A unifying framework for several cutting plane methods for semidefinite programming (Q3377972) (← links)
- An approach to robust network design in telecommunications (Q3515394) (← links)
- On the global convergence of a nonmonotone proximal bundle method for convex nonsmooth minimization (Q3539791) (← links)
- Variants to the cutting plane approach for convex nondifferentiable optimization (Q4327932) (← links)
- DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS (Q4548051) (← links)
- Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming (Q4571882) (← links)
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization (Q4639123) (← links)
- On Second-Order Properties of the Moreau–Yosida Regularization for Constrained Nonsmooth Convex Programs (Q4678764) (← links)
- Convergence analysis of a proximal newton method<sup>1</sup> (Q4714551) (← links)
- Survey of Bundle Methods for Nonsmooth Optimization (Q4806340) (← links)
- A Method for Minimization of Quasidifferentiable Functions (Q4806341) (← links)
- Interactive bundle-based method for nondifferentiable multiobjeective optimization: nimbus<sup>§</sup> (Q4888271) (← links)
- On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle (Q5024906) (← links)
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions (Q5058380) (← links)
- A derivative-free 𝒱𝒰-algorithm for convex finite-max problems (Q5113714) (← links)
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation (Q5131729) (← 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)
- On the generalization of ECP and OA methods to nonsmooth convex MINLP problems (Q5495574) (← links)
- Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems (Q5860819) (← links)
- A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization (Q5865916) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- Essentials of numerical nonsmooth optimization (Q5970841) (← links)
- A hierarchy of spectral relaxations for polynomial optimization (Q6062883) (← links)
- A hybrid conjugate gradient algorithm for nonconvex functions and its applications in image restoration problems (Q6151003) (← links)
