The following pages link to (Q3703599):
Displayed 24 items.
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems (Q291046) (← links)
- A spline smoothing Newton method for finite minimax problems (Q525261) (← links)
- Algorithms with adaptive smoothing for finite minimax problems (Q597184) (← links)
- A smooth method for the finite minimax problem (Q689121) (← links)
- Solving nonlinear programming problems with noisy function values and noisy gradients (Q700766) (← links)
- Benefit sharing in holding situations (Q707151) (← links)
- Interval tools for global optimization (Q805166) (← links)
- Benders' decomposition for the constrained \(\ell_ 1\)-problem (Q911464) (← links)
- Proximity control in bundle methods for convex nondifferentiable minimization (Q911994) (← links)
- A truncated aggregate smoothing Newton method for minimax problems (Q979271) (← links)
- Optimization with nonsmooth data (Q1097840) (← links)
- An algorithm for nondifferentiable optimization (Q1111944) (← links)
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization (Q1181737) (← links)
- Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem (Q1290717) (← links)
- Descent algorithm for a class of convex nondifferentiable functions (Q1321148) (← links)
- Nonmonotone bundle-type scheme for convex nonsmooth minimization (Q1321299) (← links)
- Nonmonotone stabilization methods for nonlinear equations (Q1331105) (← links)
- Separating plane algorithms for convex optimization (Q1356051) (← links)
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization (Q1807687) (← links)
- Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
- A quasi-second-order proximal bundle algorithm (Q1915808) (← links)
- An algorithm for minimizing a class of locally Lipschitz functions (Q2565007) (← links)
- Modeling and Managing Uncertainty in Process Planning and Scheduling (Q3638500) (← links)
- An active set method for solving linearly constrained nonsmooth optimization problems (Q3783077) (← links)