The following pages link to (Q4146571):
Displaying 50 items.
- Reflections on nondifferentiable optimization. II: Convergence (Q1131958) (← 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)
- The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients (Q1176574) (← links)
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality (Q1257414) (← links)
- The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review (Q1312749) (← links)
- Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results (Q1319860) (← links)
- New variable-metric algorithms for nondifferentiable optimization problems (Q1321115) (← links)
- Descent algorithm for a class of convex nondifferentiable functions (Q1321148) (← links)
- Nonmonotone bundle-type scheme for convex nonsmooth minimization (Q1321299) (← links)
- Convergence of some algorithms for convex minimization (Q1321649) (← links)
- On some difficult linear programs coming from set partitioning (Q1348247) (← links)
- Theorems of the alternative and duality (Q1369042) (← links)
- Smooth transformation of the generalized minimax problem (Q1372537) (← links)
- A combined relaxation method for variational inequalities with nonlinear constraints (Q1380930) (← links)
- Adjustment of O-D trip matrices from observed volumes: an algorithmic approach based on conjugate directions. (Q1427572) (← links)
- Efficiency of proximal bundle methods (Q1573991) (← links)
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization (Q1644014) (← links)
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization (Q1664251) (← 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 proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information (Q1704913) (← 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)
- A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence (Q1733318) (← links)
- Level-set methods for convex optimization (Q1739042) (← links)
- A feasible point method with bundle modification for nonsmooth convex constrained optimization (Q1753350) (← links)
- Near-optimal solutions to large-scale facility location problems (Q1779687) (← links)
- Optimal atomic-resolution structures of prion AGAAAAGA amyloid fibrils (Q1783477) (← links)
- A method of conjugate subgradients for minimization of functionals (Q1812641) (← links)
- A general method of finding the direction of descent in \(\varepsilon\)-subgradient methods (Q1912454) (← links)
- A quasi-second-order proximal bundle algorithm (Q1915808) (← links)
- New variants of bundle methods (Q1922693) (← links)
- A descent method with linear programming subproblems for nondifferentiable convex optimization (Q1924056) (← links)
- An effective nonsmooth optimization algorithm for locally Lipschitz functions (Q1934631) (← links)
- A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems (Q2069440) (← links)
- A new restricted memory level bundle method for constrained convex nonsmooth optimization (Q2080833) (← links)
- A multi-step doubly stabilized bundle method for nonsmooth convex optimization (Q2177698) (← links)
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs (Q2252688) (← links)
- Semisupervised spherical separation (Q2285335) (← links)
- A non-monotone conjugate subgradient type method for minimization of convex functions (Q2302755) (← links)
- Continuous outer subdifferentials in nonsmooth optimization (Q2328202) (← links)
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems (Q2342127) (← links)
- Aggregate codifferential method for nonsmooth DC optimization (Q2349678) (← links)
- Large-scale unit commitment under uncertainty (Q2351161) (← links)
- A generalized iterative scheme for network design problem (Q2371990) (← links)
- A Newton's method for perturbed second-order cone programs (Q2385540) (← links)
- Piecewise linear approximations in nonconvex nonsmooth optimization (Q2391130) (← links)
- A simple version of bundle method with linear programming (Q2419511) (← links)
