The following pages link to (Q3744775):
Displaying 8 items.
- Supply chain design under uncertainty using sample average approximation and dual decomposition (Q1042158) (← links)
- A constraint linearization method for nondifferentiable convex minimization (Q1099787) (← links)
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs (Q1730809) (← links)
- On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems (Q2322551) (← links)
- Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs (Q2423806) (← links)
- Solving nonsmooth inclusions in the convex case (Q3980567) (← links)
- Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs (Q5231677) (← links)
- A modified subgradient algorithm for Lagrangean relaxation (Q5926608) (← links)
