The following pages link to (Q4146571):
Displaying 50 items.
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations (Q255074) (← links)
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (Q285034) (← links)
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems (Q295480) (← links)
- On Lipschitz optimization based on gray-box piecewise linearization (Q304252) (← links)
- An optimal variant of Kelley's cutting-plane method (Q344947) (← links)
- A derivative-free approximate gradient sampling algorithm for finite minimax problems (Q360384) (← 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)
- Nonsmooth optimization via quasi-Newton methods (Q378113) (← links)
- A fast space-decomposition scheme for nonconvex eigenvalue optimization (Q526388) (← links)
- An adaptive competitive penalty method for nonsmooth constrained optimization (Q526728) (← links)
- A smooth method for the finite minimax problem (Q689121) (← links)
- Benefit sharing in holding situations (Q707151) (← links)
- Optimization for signal setting problems using non-smooth techniques (Q730911) (← links)
- Synthesis of cutting and separating planes in a nonsmooth optimization method (Q747314) (← links)
- Optimization of upper semidifferentiable functions (Q790713) (← links)
- Subgradient projection algorithm. II (Q797969) (← links)
- Airline crew scheduling: state-of-the-art (Q817210) (← links)
- Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder) (Q819950) (← links)
- An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems (Q824547) (← links)
- Approximation of the steepest descent direction for the O-D matrix adjustment problem (Q867565) (← links)
- A bundle modification strategy for convex minimization (Q869143) (← links)
- A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization (Q881511) (← links)
- A globally convergent iterative scheme for toll design network with signal settings (Q883922) (← links)
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees (Q903922) (← links)
- A partially inexact bundle method for convex semi-infinite minmax problems (Q907208) (← links)
- A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem (Q911484) (← links)
- Successive relaxation method for minimization of functionals and some efficiency estimates (Q911487) (← links)
- An efficient search algorithm for road network optimization (Q945224) (← links)
- Discrete gradient method: Derivative-free method for nonsmooth optimization (Q946181) (← links)
- Simultaneously optimizing link tolls and signal settings in a road network (Q967900) (← links)
- Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints (Q985699) (← links)
- An optimization model for area traffic control with link tolls (Q990554) (← links)
- Optimization of limited network capacity with toll settings (Q1007852) (← links)
- A non-smooth model for signalized road network design problems (Q1031591) (← links)
- On a space extension algorithm for nondifferentiable optimization (Q1054275) (← links)
- An algorithm for linearly constrained convex nondifferentiable minimization problems (Q1058460) (← links)
- A problem in parametric programming (Q1085075) (← links)
- Extensions of subgradient projection algorithms (Q1089262) (← links)
- Penalty-proximal methods in convex programming (Q1091267) (← links)
- A subgradient selection method for minimizing convex functions subject to linear constraints (Q1092621) (← links)
- Improving feasible directions for a class of nondifferentiable functions (Q1099079) (← links)
- Extension of some results for channel capacity using a generalized information measure (Q1101061) (← links)
- Optimal scheduling of reservoir releases during flood: Deterministic optimization problem. I: Procedure (Q1102855) (← links)
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs (Q1110459) (← links)
- \(\epsilon\)-subgradient projection algorithm (Q1111095) (← links)
- Sublinear upper bounds for stochastic programs with recourse (Q1115346) (← links)
- Application of the method of conjugate subgradients to minimization of quasiconvex functions (Q1119493) (← links)
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems (Q1122488) (← links)
- Reflections on nondifferentiable optimization. I: Ball gradient (Q1131956) (← links)
