scientific article; zbMATH DE number 3577030

Cited in

(only showing first 100 items - show all)

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
Reflections on nondifferentiable optimization. II: Convergence
A gradient sampling algorithm for stratified maps with applications to topological data analysis
On Lipschitz optimization based on gray-box piecewise linearization
A bundle modification strategy for convex minimization
Optimization for signal setting problems using non-smooth techniques
A derivative-free approximate gradient sampling algorithm for finite minimax problems
Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization
Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization
A partially inexact bundle method for convex semi-infinite minmax problems
New variants of bundle methods
A general method of finding the direction of descent in \(\varepsilon\)-subgradient methods
Level-set methods for convex optimization
Semisupervised spherical separation
A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
A globally convergent iterative scheme for toll design network with signal settings
An algorithm for linearly constrained convex nondifferentiable minimization problems
An optimization model for area traffic control with link tolls
An effective nonsmooth optimization algorithm for locally Lipschitz functions
Synthesis of cutting and separating planes in a nonsmooth optimization method
A fast space-decomposition scheme for nonconvex eigenvalue optimization
Sublinear upper bounds for stochastic programs with recourse
Aggregate codifferential method for nonsmooth DC optimization
A Newton's method for perturbed second-order cone programs
Variable metric methods for minimizing a class of nondifferentiable functions
Optimal atomic-resolution structures of prion AGAAAAGA amyloid fibrils
Simultaneously optimizing link tolls and signal settings in a road network
A non-smooth model for signalized road network design problems
Large-scale unit commitment under uncertainty
An efficient search algorithm for road network optimization
A quasi-second-order proximal bundle algorithm
Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization
Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder)
A single cut proximal bundle method for stochastic convex composite optimization
Optimization of congestion pricing road network with variable demands
An approximate quasi-Newton bundle-type method for nonsmooth optimization
Descent algorithm for a class of convex nondifferentiable functions
Smooth transformation of the generalized minimax problem
General Hölder smooth convergence rates follow from specialized rates assuming growth bounds
Composite nonsmooth optimization using approximate generalized gradient vectors
A combined relaxation method for variational inequalities with nonlinear constraints
A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
An optimal variant of Kelley's cutting-plane method
A bundle type approach to the unconstrained minimization of convex nonsmooth functions
A semismooth conjugate gradients method – theoretical analysis
An algorithm for minimizing a class of locally Lipschitz functions
On convergence rates of subgradient optimization methods

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)