The following pages link to New variants of bundle methods (Q1922693):
Displaying 50 items.
- A doubly stabilized bundle method for nonsmooth convex optimization (Q263188) (← links)
- Solving variational inequalities with monotone operators on domains given by linear minimization oracles (Q263192) (← links)
- 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)
- Applying oracles of on-demand accuracy in two-stage stochastic programming -- a computational study (Q297279) (← links)
- A regularized simplex method (Q302140) (← links)
- Benders decomposition without separability: a computational study for capacitated facility location problems (Q323204) (← links)
- Applications of gauge duality in robust principal component analysis and semidefinite programming (Q341322) (← links)
- An optimal variant of Kelley's cutting-plane method (Q344947) (← links)
- Solving generation expansion planning problems with environmental constraints by a bundle method (Q373184) (← links)
- Implementing the simplex method as a cutting-plane method, with a view to regularization (Q377719) (← links)
- Level bundle methods for constrained convex optimization with various oracles (Q404512) (← links)
- Approximate level method for nonsmooth convex minimization (Q415377) (← links)
- Numerical methods for stochastic programs with second order dominance constraints with applications to portfolio optimization (Q421765) (← links)
- Method of conjugate subgradients with constrained memory (Q463369) (← links)
- Optimum design accounting for the global nonlinear behavior of the model (Q464189) (← links)
- Dual subgradient algorithms for large-scale nonsmooth learning problems (Q484132) (← links)
- Conditional gradient algorithms for norm-regularized smooth convex optimization (Q494314) (← links)
- Universal gradient methods for convex optimization problems (Q494332) (← links)
- Regularized optimization methods for convex MINLP problems (Q518454) (← links)
- Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems (Q526828) (← links)
- A tutorial on column generation and branch-and-price for vehicle routing problems (Q633483) (← links)
- Processing second-order stochastic dominance models using cutting-plane representations (Q647395) (← links)
- Learning the coordinate gradients (Q695644) (← links)
- Validation analysis of mirror descent stochastic approximation method (Q715058) (← 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)
- Level bundle-like algorithms for convex optimization (Q743968) (← links)
- Synthesis of cutting and separating planes in a nonsmooth optimization method (Q747314) (← links)
- A cutting-plane method without inclusions of approximating sets for conditional minimization (Q748232) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- A bundle modification strategy for convex minimization (Q869143) (← links)
- The approximation algorithm for solving a sort of non-smooth programming (Q884618) (← links)
- A partially inexact bundle method for convex semi-infinite minmax problems (Q907208) (← links)
- Handling CVaR objectives and constraints in two-stage stochastic models (Q932208) (← links)
- A bundle-filter method for nonsmooth convex constrained optimization (Q959944) (← links)
- A bundle method for solving equilibrium problems (Q959957) (← 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)
- Mixed method for solving the general convex programming problem (Q1288666) (← links)
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method (Q1361108) (← links)
- Partitioning mathematical programs for parallel solution (Q1380936) (← links)
- Efficiency of proximal bundle methods (Q1573991) (← links)
- Risk-averse formulations and methods for a virtual power plant (Q1652695) (← links)
- A method for convex minimization based on translated first-order approximations (Q1681778) (← links)
- Optimal subgradient algorithms for large-scale convex optimization in simple domains (Q1689457) (← links)
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information (Q1704913) (← links)
- A robust signal control system for equilibrium flow under uncertain travel demand and traffic delay (Q1716465) (← links)
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems (Q1717575) (← links)
