scientific article; zbMATH DE number 3577030

Cited in

(only showing first 100 items - show all)

Optimization of limited network capacity with toll settings
A non-smooth model for signalized road network design problems
On a space extension algorithm for nondifferentiable optimization
An algorithm for linearly constrained convex nondifferentiable minimization problems
A problem in parametric programming
Extensions of subgradient projection algorithms
Penalty-proximal methods in convex programming
A subgradient selection method for minimizing convex functions subject to linear constraints
Improving feasible directions for a class of nondifferentiable functions
Extension of some results for channel capacity using a generalized information measure
Optimal scheduling of reservoir releases during flood: Deterministic optimization problem. I: Procedure
Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
\(\epsilon\)-subgradient projection algorithm
Sublinear upper bounds for stochastic programs with recourse
Application of the method of conjugate subgradients to minimization of quasiconvex functions
A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
Reflections on nondifferentiable optimization. I: Ball gradient
Reflections on nondifferentiable optimization. II: Convergence
A minimization method for the sum of a convex function and a continuously differentiable function
An implementable algorithm for the optimal design centering, tolerancing, and tuning problem
A subgradient projection algorithm
The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review
Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results
New variable-metric algorithms for nondifferentiable optimization problems
Descent algorithm for a class of convex nondifferentiable functions
Nonmonotone bundle-type scheme for convex nonsmooth minimization
Convergence of some algorithms for convex minimization
On some difficult linear programs coming from set partitioning
Theorems of the alternative and duality
Smooth transformation of the generalized minimax problem
A combined relaxation method for variational inequalities with nonlinear constraints
Adjustment of O-D trip matrices from observed volumes: an algorithmic approach based on conjugate directions.
Efficiency of proximal bundle methods
Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
A method for convex minimization based on translated first-order approximations
On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem
Large-scale unit commitment under uncertainty: an updated literature survey
A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence
Level-set methods for convex optimization
A feasible point method with bundle modification for nonsmooth convex constrained optimization
Near-optimal solutions to large-scale facility location problems
Optimal atomic-resolution structures of prion AGAAAAGA amyloid fibrils
A method of conjugate subgradients for minimization of functionals
A general method of finding the direction of descent in \(\varepsilon\)-subgradient methods
A quasi-second-order proximal bundle algorithm
New variants of bundle methods
A descent method with linear programming subproblems for nondifferentiable convex optimization
An effective nonsmooth optimization algorithm for locally Lipschitz functions
A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems
A new restricted memory level bundle method for constrained convex nonsmooth optimization
A multi-step doubly stabilized bundle method for nonsmooth convex optimization
A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
Semisupervised spherical separation
A non-monotone conjugate subgradient type method for minimization of convex functions
Continuous outer subdifferentials in nonsmooth optimization
A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
Aggregate codifferential method for nonsmooth DC optimization
Large-scale unit commitment under uncertainty
A generalized iterative scheme for network design problem
A Newton's method for perturbed second-order cone programs
Piecewise linear approximations in nonconvex nonsmooth optimization
A simple version of bundle method with linear programming
Numerical infinitesimals in a variable metric method for convex nonsmooth optimization
New algorithmic alternatives for the O--D matrix adjustment problem on traffic networks
Optimization of congestion pricing road network with variable demands
On the method of shortest residuals for unconstrained optimization
A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
An algorithm for minimizing a class of locally Lipschitz functions
A proximal trust-region algorithm for column generation stabilization
The bundle scheme for solving arbitrary eigenvalue optimizations
General Hölder smooth convergence rates follow from specialized rates assuming growth bounds
Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems
On Lipschitz optimization based on gray-box piecewise linearization
A descent algorithm for nonsmooth convex optimization
Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
An optimal variant of Kelley's cutting-plane method
A derivative-free approximate gradient sampling algorithm for finite minimax problems
A hybrid approach of bundle and Benders applied large mixed linear integer problem
An approximate quasi-Newton bundle-type method for nonsmooth optimization
A regularized decomposition method for minimizing a sum of polyhedral functions
The method of successive affine reduction for nonlinear minimization
Nonsmooth optimization via quasi-Newton methods
Properties of functions satisfying a local Lipschitz condition
Variable metric methods for minimizing a class of nondifferentiable functions
A modified reduced gradient method for a class of nondifferentiable problems
scientific article; zbMATH DE number 3727086 (Why is no real title available?)
A bundle type approach to the unconstrained minimization of convex nonsmooth functions
ε-Optimal solutions in nondifferentiable convex programming and some related questions
Note on a method of conjugate subgradients for minimizing nondifferentiable functions
On convergence rates of subgradient optimization methods
On the Fermat—Weber problem with convex cost functions
A subgradient algorithm for certain minimax and minisum problems
Optimization of lipschitz continuous functions
scientific article; zbMATH DE number 1062863 (Why is no real title available?)

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)