The following pages link to (Q4146571):
Displaying 45 items.
- Numerical infinitesimals in a variable metric method for convex nonsmooth optimization (Q2422878) (← links)
- New algorithmic alternatives for the O--D matrix adjustment problem on traffic networks (Q2433515) (← links)
- Optimization of congestion pricing road network with variable demands (Q2470141) (← links)
- On the method of shortest residuals for unconstrained optimization (Q2471088) (← links)
- An algorithm for minimizing a class of locally Lipschitz functions (Q2565007) (← links)
- A proximal trust-region algorithm for column generation stabilization (Q2571184) (← links)
- The bundle scheme for solving arbitrary eigenvalue optimizations (Q2628175) (← links)
- General Hölder smooth convergence rates follow from specialized rates assuming growth bounds (Q2696991) (← links)
- A descent algorithm for nonsmooth convex optimization (Q3337229) (← links)
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut (Q3430946) (← links)
- A regularized decomposition method for minimizing a sum of polyhedral functions (Q3735489) (← links)
- The method of successive affine reduction for nonlinear minimization (Q3758575) (← links)
- Properties of functions satisfying a local Lipschitz condition (Q3882205) (← links)
- Variable metric methods for minimizing a class of nondifferentiable functions (Q3883929) (← links)
- A modified reduced gradient method for a class of nondifferentiable problems (Q3902833) (← links)
- (Q3915546) (← links)
- A bundle type approach to the unconstrained minimization of convex nonsmooth functions (Q3938844) (← links)
- ε-Optimal solutions in nondifferentiable convex programming and some related questions (Q3959749) (← links)
- Note on a method of conjugate subgradients for minimizing nondifferentiable functions (Q4050401) (← links)
- On convergence rates of subgradient optimization methods (Q4145170) (← links)
- On the Fermat—Weber problem with convex cost functions (Q4152041) (← links)
- A subgradient algorithm for certain minimax and minisum problems (Q4174536) (← links)
- Optimization of lipschitz continuous functions (Q4177351) (← links)
- (Q4355317) (← links)
- A Level-Set Method for Convex Optimization with a Feasible Solution Path (Q4562247) (← links)
- Subdifferentials of functions on sets (Q4745625) (← links)
- Note on an extension of “Davidon” methods to nondifferentiable functions (Q4777068) (← links)
- Choice of a step-length in an almost everywhere differentiable (on every direction) (almost everywhere locally lipschitz) lower-semi-continuous minimization problem (Q4894151) (← links)
- A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes (Q5013585) (← links)
- Proximal Gradient Methods for Machine Learning and Imaging (Q5028165) (← links)
- (Q5053289) (← links)
- Analysis of the gradient method with an Armijo–Wolfe line search on a class of non-smooth convex functions (Q5210738) (← links)
- Minimizing Piecewise-Concave Functions Over Polyhedra (Q5219555) (← links)
- Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values (Q5746456) (← links)
- Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems (Q5860819) (← links)
- Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization (Q5883313) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- The omnipresence of Lagrange (Q5920487) (← links)
- Composite nonsmooth optimization using approximate generalized gradient vectors (Q5959905) (← links)
- Essentials of numerical nonsmooth optimization (Q5970841) (← links)
- A gradient sampling algorithm for stratified maps with applications to topological data analysis (Q6052059) (← links)
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)
- A hybrid conjugate gradient algorithm for nonconvex functions and its applications in image restoration problems (Q6151003) (← links)
- Optimal Convergence Rates for the Proximal Bundle Method (Q6155876) (← links)
- A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods (Q6160378) (← links)
