Pages that link to "Item:Q3277806"
From MaRDI portal
The following pages link to The Cutting-Plane Method for Solving Convex Programs (Q3277806):
Displaying 50 items.
- Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
- Cutting-plane method based on epigraph approximation with discarding the cutting planes (Q276160) (← links)
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems (Q291046) (← links)
- A robust optimization approach to energy and reserve dispatch in electricity markets (Q320057) (← links)
- Benders decomposition without separability: a computational study for capacitated facility location problems (Q323204) (← links)
- An optimal variant of Kelley's cutting-plane method (Q344947) (← links)
- Metabolic cost of neuronal information in an empirical stimulus-response model (Q353894) (← links)
- The proximal Chebychev center cutting plane algorithm for convex additive functions (Q359628) (← links)
- A hybrid approach of bundle and Benders applied large mixed linear integer problem (Q364462) (← links)
- Implementing the simplex method as a cutting-plane method, with a view to regularization (Q377719) (← links)
- A feasible directions method for nonsmooth convex optimization (Q381628) (← links)
- Approximate level method for nonsmooth convex minimization (Q415377) (← links)
- Multi-instance multi-label learning (Q420823) (← links)
- Managing capacity flexibility in make-to-order production environments (Q421760) (← links)
- Computing of high breakdown regression estimators without sorting on graphics processing units (Q425179) (← links)
- Common diagonal Lyapunov function for third order linear switched system (Q432788) (← links)
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem (Q434153) (← links)
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions (Q439450) (← links)
- Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria (Q460659) (← links)
- Optimum design accounting for the global nonlinear behavior of the model (Q464189) (← links)
- Constrained nonconvex nonsmooth optimization via proximal bundle method (Q481058) (← links)
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles (Q484139) (← links)
- Solving DC programs using the cutting angle method (Q486726) (← links)
- Robust location transportation problems under uncertain demands (Q496635) (← links)
- Regularized optimization methods for convex MINLP problems (Q518454) (← links)
- Cutting plane algorithms and approximate lower subdifferentiability (Q535075) (← links)
- Globally convergent cutting plane method for nonconvex nonsmooth minimization (Q535081) (← links)
- Product differentiation and operations strategy in a capacitated environment (Q541734) (← links)
- A one-parameter filled function for nonsmooth global optimization and its application (Q545434) (← links)
- Two-direction subgradient method for non-differentiable optimization problems (Q581239) (← links)
- Cutting sphere algorithm (Q597178) (← links)
- Analysis of stochastic dual dynamic programming method (Q617520) (← links)
- A tutorial on column generation and branch-and-price for vehicle routing problems (Q633483) (← links)
- Mathematical model for cyclic scheduling with work-in-process minimization (Q656064) (← links)
- An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
- Using central prices in the decomposition of linear programs (Q684317) (← links)
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems (Q686998) (← links)
- Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes (Q715233) (← links)
- A generalized projection-based scheme for solving convex constrained optimization problems (Q721952) (← links)
- Stochastic programming with multivariate second order stochastic dominance constraints with applications in portfolio optimization (Q741144) (← links)
- Synthesis of cutting and separating planes in a nonsmooth optimization method (Q747314) (← links)
- Chebyshev center based column generation (Q765323) (← links)
- On the convergence of a class of outer approximation algorithms for convex programs (Q789154) (← links)
- Lower subdifferentiable functions and their minimization by cutting planes (Q795741) (← links)
- A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems (Q799488) (← links)
- On the global minimization of concave functions (Q800693) (← links)
- Localization of multi-constrained optima and avoidance of local optima in structural optimization problems (Q801740) (← links)
- Methods for solving multi-extremal problems (global search) (Q811399) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems (Q824547) (← links)
