Pages that link to "Item:Q2564758"
From MaRDI portal
The following pages link to Solving semidefinite quadratic problems within nonsmooth optimization algorithms (Q2564758):
Displaying 32 items.
- The proximal Chebychev center cutting plane algorithm for convex additive functions (Q359628) (← links)
- A stabilized structured Dantzig-Wolfe decomposition method (Q359629) (← links)
- Codifferential method for minimizing nonsmooth DC functions (Q539496) (← links)
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems (Q647397) (← links)
- An exact method with variable fixing for solving the generalized assignment problem (Q694523) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization (Q848722) (← links)
- Discrete gradient method: Derivative-free method for nonsmooth optimization (Q946181) (← links)
- Computing proximal points of nonconvex functions (Q959941) (← links)
- A bundle-filter method for nonsmooth convex constrained optimization (Q959944) (← links)
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization (Q1013976) (← links)
- An inexact bundle variant suited to column generation (Q1016116) (← links)
- On the choice of explicit stabilizing terms in column generation (Q1025985) (← links)
- Lagrangian relaxation for SVM feature selection (Q1652409) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- Room allocation: a polynomial subcase of the quadratic assignment problem (Q1765233) (← links)
- Algebraic solution of the problems of nonconvex quadratic programming (Q1778975) (← links)
- Solving nearly-separable quadratic optimization problems as nonsmooth equations (Q2013144) (← links)
- An augmented subgradient method for minimizing nonsmooth DC functions (Q2231043) (← links)
- Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
- An illumination problem: optimal apex and optimal orientation for a cone of light (Q2250115) (← links)
- Tuning strategy for the proximity parameter in convex minimization (Q2370054) (← links)
- Computation of approximate \(\alpha \)-points for large scale single machine scheduling problem (Q2482376) (← links)
- New approaches for optimizing over the semimetric polytope (Q2576727) (← links)
- A bundle-type algorithm for routing in telecommunication data networks (Q2655403) (← links)
- An approach to robust network design in telecommunications (Q3515394) (← links)
- Incremental Bundle Methods using Upper Models (Q4603045) (← links)
- A splitting bundle approach for non-smooth non-convex minimization (Q5248228) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design (Q5946817) (← links)
- Essentials of numerical nonsmooth optimization (Q5970841) (← links)
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)
