scientific article; zbMATH DE number 3619635
From MaRDI portal
Publication:4182270
zbMath0398.90088MaRDI QIDQ4182270
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem, A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions, A generalized iterative scheme for network design problem, Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems, Penalty-proximal methods in convex programming, Nonconvex bundle method with application to a delamination problem, A tilted cutting plane proximal bundle method for convex nondifferentiable optimization, An inexact multiple proximal bundle algorithm for nonsmooth nonconvex multiobjective optimization problems, A bi-level programming for logistics network design with system-optimized flows, The developments of proximal point algorithms, Stochastic Nash equilibrium problems: sample average approximation and applications, A new class of multilevel decomposition algorithms for non-monotone problems based on the quasidifferentiability concept, Some remarks on the construction of higher order algorithms in convex optimization, A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems, Scheduling job shops with batch machines using the Lagrangian relaxation technique, Qualitative aspects of the local approximation of a piecewise differentiable function, A globally convergent iterative scheme for toll design network with signal settings, A simple version of bundle method with linear programming, A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information, A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective, New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information, Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs, Continuity of the approximate subdifferential, Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs, A cutting plane projection method for bi-level area traffic control optimization with uncertain travel demand, An efficient search algorithm for road network optimization, Optimization of congestion pricing road network with variable demands, Exploration of distributional models for a novel intensity-dependent normalization procedure in censored gene expression data, Simultaneously optimizing link tolls and signal settings in a road network, A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization, A derivative-free trust-region algorithm for composite nonsmooth optimization, Two-direction subgradient method for non-differentiable optimization problems, An optimization model for area traffic control with link tolls, Optimization for signal setting problems using non-smooth techniques, Optimization of limited network capacity with toll settings, Finding the closest point to the origin in the convex hull of a discrete set of points, On the choice of explicit stabilizing terms in column generation, A proximal bundle-based algorithm for nonsmooth constrained multiobjective optimization problems with inexact data, Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs, Accelerating the regularized decomposition method for two stage stochastic linear problems, A non-smooth model for signalized road network design problems, A bundle-Newton method for nonsmooth unconstrained minimization, On a space extension algorithm for nondifferentiable optimization, An algorithm for composite nonsmooth optimization problems, An algorithm for linearly constrained convex nondifferentiable minimization problems
