Pages that link to "Item:Q5387972"

The following pages link to An Incremental Method for Solving Convex Finite Min-Max Problems (Q5387972):

Displaying 17 items.

• Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems (Q288406) (← links)
• Lower and upper bounds for the spanning tree with minimum branch vertices (Q377727) (← links)
• Convex proximal bundle methods in depth: a unified analysis for inexact oracles (Q484139) (← links)
• A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints (Q515950) (← links)
• On solving the Lagrangian dual of integer programs via an incremental approach (Q849073) (← links)
• A partially inexact bundle method for convex semi-infinite minmax problems (Q907208) (← links)
• Incremental-like bundle methods with application to energy planning (Q975362) (← links)
• A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities (Q1616935) (← links)
• Probabilistic optimization via approximate \(p\)-efficient points and bundle methods (Q1652036) (← links)
• A method for convex minimization based on translated first-order approximations (Q1681778) (← links)
• The effect of deterministic noise in subgradient methods (Q1960191) (← links)
• An incremental bundle method for portfolio selection problem under second-order stochastic dominance (Q2200800) (← links)
• A proximal-projection partial bundle method for convex constrained minimax problems (Q2313762) (← links)
• Optimal replenishment order placement in a finite time horizon (Q2342144) (← links)
• Piecewise linear approximations in nonconvex nonsmooth optimization (Q2391130) (← links)
• Adaptive Bundle Methods for Nonlinear Robust Optimization (Q5106409) (← links)
• Minimizing Piecewise-Concave Functions Over Polyhedra (Q5219555) (← links)