scientific article; zbMATH DE number 3577030

Cited in

(only showing first 100 items - show all)

Airline crew scheduling: state-of-the-art
A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem
Successive relaxation method for minimization of functionals and some efficiency estimates
Piecewise linear approximations in nonconvex nonsmooth optimization
A method for convex minimization based on translated first-order approximations
A descent algorithm for nonsmooth convex optimization
Discrete gradient method: Derivative-free method for nonsmooth optimization
A method of conjugate subgradients for minimization of functionals
Theorems of the alternative and duality
A hybrid approach of bundle and Benders applied large mixed linear integer problem
scientific article; zbMATH DE number 3727086 (Why is no real title available?)
On a space extension algorithm for nondifferentiable optimization
A regularized decomposition method for minimizing a sum of polyhedral functions
New algorithmic alternatives for the O--D matrix adjustment problem on traffic networks
Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
Nonmonotone bundle-type scheme for convex nonsmooth minimization
Bundle method for non-convex minimization with inexact subgradients and function values
On some difficult linear programs coming from set partitioning
Optimization of upper semidifferentiable functions
scientific article; zbMATH DE number 7626778 (Why is no real title available?)
A smooth method for the finite minimax problem
Subgradient projection algorithm. II
A non-monotone conjugate subgradient type method for minimization of convex functions
ε-Optimal solutions in nondifferentiable convex programming and some related questions
A descent method with linear programming subproblems for nondifferentiable convex optimization
A new restricted memory level bundle method for constrained convex nonsmooth optimization
Choice of a step-length in an almost everywhere differentiable (on every direction) (almost everywhere locally lipschitz) lower-semi-continuous minimization problem
A multi-step doubly stabilized bundle method for nonsmooth convex optimization
Near-optimal solutions to large-scale facility location problems
Subdifferentials of functions on sets
Optimization of limited network capacity with toll settings
Efficiency of proximal bundle methods
An implementable algorithm for the optimal design centering, tolerancing, and tuning problem
A subgradient projection algorithm
New variable-metric algorithms for nondifferentiable optimization problems
A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem
Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods
The bundle scheme for solving arbitrary eigenvalue optimizations
A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
On the method of shortest residuals for unconstrained optimization
Optimization of lipschitz continuous functions
A simple version of bundle method with linear programming
A problem in parametric programming
Note on an extension of “Davidon” methods to nondifferentiable functions
A modified reduced gradient method for a class of nondifferentiable problems
An adaptive competitive penalty method for nonsmooth constrained optimization
An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems
A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
A subgradient algorithm for certain minimax and minisum problems
A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems
Essentials of numerical nonsmooth optimization
Extensions of subgradient projection algorithms
A subgradient selection method for minimizing convex functions subject to linear constraints
A generalized iterative scheme for network design problem
On the Fermat—Weber problem with convex cost functions
Continuous outer subdifferentials in nonsmooth optimization
Nonsmooth optimization via quasi-Newton methods
Improving feasible directions for a class of nondifferentiable functions
Analysis of the gradient method with an Armijo-Wolfe line search on a class of non-smooth convex functions
A proximal trust-region algorithm for column generation stabilization
Large-scale unit commitment under uncertainty: an updated literature survey
A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence
The method of successive affine reduction for nonlinear minimization
The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review
Optimal Convergence Rates for the Proximal Bundle Method
Optimal scheduling of reservoir releases during flood: Deterministic optimization problem. I: Procedure
Properties of functions satisfying a local Lipschitz condition
Minimizing Piecewise-Concave Functions Over Polyhedra
Benefit sharing in holding situations
Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
A hybrid conjugate gradient algorithm for nonconvex functions and its applications in image restoration problems
Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
Numerical infinitesimals in a variable metric method for convex nonsmooth optimization
The omnipresence of Lagrange
Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems
A minimization method for the sum of a convex function and a continuously differentiable function
A level-set method for convex optimization with a feasible solution path
\(\epsilon\)-subgradient projection algorithm
Proximal Gradient Methods for Machine Learning and Imaging
scientific article; zbMATH DE number 1062863 (Why is no real title available?)
Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints
Note on a method of conjugate subgradients for minimizing nondifferentiable functions
A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems
A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
Convergence of some algorithms for convex minimization
Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results
On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods
Essentials of numerical nonsmooth optimization
Adjustment of O-D trip matrices from observed volumes: an algorithmic approach based on conjugate directions.
Application of the method of conjugate subgradients to minimization of quasiconvex functions
A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes
A feasible point method with bundle modification for nonsmooth convex constrained optimization
Approximation of the steepest descent direction for the O-D matrix adjustment problem
Penalty-proximal methods in convex programming
Extension of some results for channel capacity using a generalized information measure
Reflections on nondifferentiable optimization. I: Ball gradient

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4146571)