scientific article; zbMATH DE number 3972657
From MaRDI portal
Publication:3738946
Recommendations
Cited in
(35)- Decomposition method of descent for minimizing the sum of convex nonsmooth functions
- A constraint linearization method for nondifferentiable convex minimization
- Descent methods for quasidifferentiable minimization
- Accelerating the regularized decomposition method for two stage stochastic linear problems
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- Block-iterative surrogate projection methods for convex feasibility problems
- Approximate solution of Hamilton-Jacobi inequality by neural networks
- Optimal prestress of cracked unilateral structures: Finite element analysis of an optimal control problem for variational inequalities.
- Two numerical methods for optimizing matrix stability
- New diagonal bundle method for clustering problems in large data sets
- Generalized descent method for minimization of functionals
- Interval methods for global optimization
- Conservative descent for semi-orthogonal decompositions
- Descent methods for convex optimization problems in Banach spaces
- Mirror descent and convex optimization problems with non-smooth inequality constraints
- A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- A tilted cutting plane proximal bundle method for convex nondifferentiable optimization
- A descent algorithm for nonsmooth convex optimization
- scientific article; zbMATH DE number 4149901 (Why is no real title available?)
- scientific article; zbMATH DE number 3912124 (Why is no real title available?)
- scientific article; zbMATH DE number 3916028 (Why is no real title available?)
- Descent methods for composite nondifferentiable optimization problems
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- scientific article; zbMATH DE number 727769 (Why is no real title available?)
- scientific article; zbMATH DE number 1070384 (Why is no real title available?)
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
- Approximate norm descent methods for constrained nonlinear systems
- scientific article; zbMATH DE number 7347554 (Why is no real title available?)
- Codifferential method for minimizing nonsmooth DC functions
- Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder)
- A bundle modification strategy for convex minimization
- Descent gradient methods for nonsmooth minimization problems in ill-posed problems
- A truncated aggregate smoothing Newton method for minimax problems
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 Q3738946)
