The following pages link to (Q3738946):
Displaying 29 items.
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions (Q439450) (← links)
- Codifferential method for minimizing nonsmooth DC functions (Q539496) (← links)
- Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder) (Q819950) (← links)
- A bundle modification strategy for convex minimization (Q869143) (← links)
- Descent gradient methods for nonsmooth minimization problems in ill-posed problems (Q908377) (← links)
- A truncated aggregate smoothing Newton method for minimax problems (Q979271) (← links)
- Descent methods for quasidifferentiable minimization (Q1109687) (← links)
- Accelerating the regularized decomposition method for two stage stochastic linear problems (Q1278964) (← links)
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
- Block-iterative surrogate projection methods for convex feasibility problems (Q1347226) (← links)
- Approximate solution of Hamilton-Jacobi inequality by neural networks (Q1363819) (← links)
- Optimal prestress of cracked unilateral structures: Finite element analysis of an optimal control problem for variational inequalities. (Q1578637) (← links)
- Two numerical methods for optimizing matrix stability (Q1611899) (← links)
- New diagonal bundle method for clustering problems in large data sets (Q1694910) (← links)
- Generalized descent method for minimization of functionals (Q1822757) (← links)
- Interval methods for global optimization (Q1914643) (← links)
- Conservative descent for semi-orthogonal decompositions (Q2281319) (← links)
- Descent methods for convex optimization problems in Banach spaces (Q2368348) (← links)
- Mirror descent and convex optimization problems with non-smooth inequality constraints (Q2415205) (← links)
- A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming (Q2462105) (← links)
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms (Q2564758) (← links)
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems (Q2572256) (← links)
- A tilted cutting plane proximal bundle method for convex nondifferentiable optimization (Q2638937) (← links)
- (Q3688115) (← links)
- Descent methods for composite nondifferentiable optimization problems (Q3705231) (← links)
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization (Q3988952) (← links)
- (Q4356861) (← links)
- Approximate norm descent methods for constrained nonlinear systems (Q4605702) (← links)
- (Q4988121) (← links)
