The following pages link to (Q3343782):
Displaying 17 items.
- An algorithm for linearly constrained convex nondifferentiable minimization problems (Q1058460) (← links)
- A subgradient selection method for minimizing convex functions subject to linear constraints (Q1092621) (← links)
- Improving feasible directions for a class of nondifferentiable functions (Q1099079) (← links)
- A constraint linearization method for nondifferentiable convex minimization (Q1099787) (← links)
- On an approach to the construction of algorithms for the unconditional minimization of pseudoconvex functions (Q1589847) (← links)
- A new algorithm for minimizing convex functions over convex sets (Q1918926) (← links)
- An implementation of a reduced subgradient method via Luenberger-Mokhtar variant (Q2817227) (← links)
- A reduced subgradient algorithm (Q3026768) (← links)
- A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints (Q3188452) (← links)
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization (Q3730358) (← links)
- (Q3972979) (← links)
- ALGORITHMS FOR L-CONVEX FUNCTION MINIMIZATION: CONNECTION BETWEEN DISCRETE CONVEX ANALYSIS AND OTHER RESEARCH FIELDS (Q4596997) (← links)
- On the Behavior of the Douglas--Rachford Algorithm for Minimizing a Convex Function Subject to a Linear Constraint (Q4971015) (← links)
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions (Q5221263) (← links)
- An algorithm using Moreau-Yosida regularization for minimization of a nondifferentiable convex function (Q5259436) (← links)
- An Optimal Algorithm for Constrained Differentiable Convex Optimization (Q5408206) (← links)
- A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems (Q5470232) (← links)
