The following pages link to (Q4132264):
Displayed 19 items.
- 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)
- 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)
- On the method of shortest residuals for unconstrained optimization (Q2471088) (← links)
- An algorithm for minimizing a class of locally Lipschitz functions (Q2565007) (← links)