The following pages link to (Q4182270):
Displaying 42 items.
- Nonconvex bundle method with application to a delamination problem (Q316176) (← links)
- Two-direction subgradient method for non-differentiable optimization problems (Q581239) (← links)
- Some remarks on the construction of higher order algorithms in convex optimization (Q595339) (← links)
- A cutting plane projection method for bi-level area traffic control optimization with uncertain travel demand (Q669373) (← links)
- Optimization for signal setting problems using non-smooth techniques (Q730911) (← links)
- A globally convergent iterative scheme for toll design network with signal settings (Q883922) (← links)
- An efficient search algorithm for road network optimization (Q945224) (← links)
- Exploration of distributional models for a novel intensity-dependent normalization procedure in censored gene expression data (Q961384) (← links)
- Simultaneously optimizing link tolls and signal settings in a road network (Q967900) (← links)
- An optimization model for area traffic control with link tolls (Q990554) (← links)
- Optimization of limited network capacity with toll settings (Q1007852) (← links)
- On the choice of explicit stabilizing terms in column generation (Q1025985) (← 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 composite nonsmooth optimization problems (Q1057188) (← links)
- An algorithm for linearly constrained convex nondifferentiable minimization problems (Q1058460) (← links)
- Penalty-proximal methods in convex programming (Q1091267) (← links)
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems (Q1122488) (← links)
- Continuity of the approximate subdifferential (Q1176895) (← links)
- Finding the closest point to the origin in the convex hull of a discrete set of points (Q1260737) (← links)
- Accelerating the regularized decomposition method for two stage stochastic linear problems (Q1278964) (← links)
- A bundle-Newton method for nonsmooth unconstrained minimization (Q1290669) (← links)
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
- Scheduling job shops with batch machines using the Lagrangian relaxation technique (Q1383473) (← links)
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs (Q1730809) (← links)
- A new class of multilevel decomposition algorithms for non-monotone problems based on the quasidifferentiability concept (Q1913139) (← links)
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization (Q2007826) (← links)
- A derivative-free trust-region algorithm for composite nonsmooth optimization (Q2013620) (← links)
- A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data (Q2066220) (← links)
- Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems (Q2136887) (← links)
- An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems (Q2150773) (← links)
- The developments of proximal point algorithms (Q2158107) (← links)
- A generalized iterative scheme for network design problem (Q2371990) (← links)
- A bi-level programming for logistics network design with system-optimized flows (Q2390364) (← links)
- Stochastic Nash equilibrium problems: sample average approximation and applications (Q2393651) (← links)
- A simple version of bundle method with linear programming (Q2419511) (← links)
- Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs (Q2423806) (← links)
- Optimization of congestion pricing road network with variable demands (Q2470141) (← links)
- A tilted cutting plane proximal bundle method for convex nondifferentiable optimization (Q2638937) (← links)
- A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information (Q6059582) (← links)
- A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective (Q6093282) (← links)
- New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information (Q6093975) (← links)
