The following pages link to (Q4132264):
Displaying 50 items.
- An optimal variant of Kelley's cutting-plane method (Q344947) (← links)
- A hybrid approach of bundle and Benders applied large mixed linear integer problem (Q364462) (← links)
- An approximate quasi-Newton bundle-type method for nonsmooth optimization (Q370139) (← links)
- Method of conjugate subgradients with constrained memory (Q463369) (← links)
- Constrained nonconvex nonsmooth optimization via proximal bundle method (Q481058) (← links)
- Hub-and-spoke network design and fleet deployment for string planning of liner shipping (Q727347) (← links)
- Synthesis of cutting and separating planes in a nonsmooth optimization method (Q747314) (← links)
- Nondifferentiable optimization algorithm for designing control systems having singular value inequalities (Q788989) (← links)
- Optimization of upper semidifferentiable functions (Q790713) (← links)
- Bimodal optimal design of vibrating plates using theory and methods of nondifferentiable optimization (Q793577) (← links)
- Subgradient projection algorithm. II (Q797969) (← links)
- An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems (Q824547) (← links)
- A bundle modification strategy for convex minimization (Q869143) (← links)
- A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem (Q911484) (← links)
- Discrete gradient method: Derivative-free method for nonsmooth optimization (Q946181) (← links)
- On a space extension algorithm for nondifferentiable optimization (Q1054275) (← links)
- Penalty-proximal methods in convex programming (Q1091267) (← links)
- Extension of some results for channel capacity using a generalized information measure (Q1101061) (← links)
- \(\epsilon\)-subgradient projection algorithm (Q1111095) (← links)
- A minimization method for the sum of a convex function and a continuously differentiable function (Q1134011) (← links)
- An implementable algorithm for the optimal design centering, tolerancing, and tuning problem (Q1151827) (← links)
- A subgradient projection algorithm (Q1164968) (← links)
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality (Q1257414) (← links)
- Descent algorithm for a class of convex nondifferentiable functions (Q1321148) (← links)
- Nonmonotone bundle-type scheme for convex nonsmooth minimization (Q1321299) (← links)
- A new nonsmooth bundle-type approach for a class of functional equations in Hilbert spaces (Q1674075) (← links)
- A method for convex minimization based on translated first-order approximations (Q1681778) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem (Q1711458) (← links)
- Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
- Level-set methods for convex optimization (Q1739042) (← links)
- A feasible point method with bundle modification for nonsmooth convex constrained optimization (Q1753350) (← links)
- The noncooperative transportation problem and linear generalized Nash games (Q1754116) (← links)
- Regularized decomposition of large scale block-structured robust optimization problems (Q1789623) (← links)
- Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley (Q2030657) (← links)
- Stochastic dynamic cutting plane for multistage stochastic convex programs (Q2032005) (← links)
- A new restricted memory level bundle method for constrained convex nonsmooth optimization (Q2080833) (← links)
- Machine learning algorithms of relaxation subgradient method with space extension (Q2117655) (← links)
- A multi-step doubly stabilized bundle method for nonsmooth convex optimization (Q2177698) (← links)
- Asynchronous level bundle methods (Q2205980) (← links)
- On the properties of the method of minimization for convex functions with relaxation on the distance to extremum (Q2287166) (← links)
- A non-monotone conjugate subgradient type method for minimization of convex functions (Q2302755) (← links)
- A proximal-projection partial bundle method for convex constrained minimax problems (Q2313762) (← links)
- On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems (Q2322551) (← links)
- Large-scale unit commitment under uncertainty (Q2351161) (← links)
- A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems (Q2414914) (← links)
- A simple version of bundle method with linear programming (Q2419511) (← links)
- Fast bundle-level methods for unconstrained and ball-constrained convex optimization (Q2419544) (← links)
- On the method of shortest residuals for unconstrained optimization (Q2471088) (← links)
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization (Q2515032) (← links)
