Pages that link to "Item:Q1323947"

The following pages link to A two-level subgradient method for finding saddle points of convex- concave functions (Q1323947):

Displaying 9 items.

• A continuous algorithm for finding the saddle points of convex-concave functions (Q797134) (← links)
• Subgradient methods for saddle-point problems (Q1035898) (← links)
• Two general methods for computing saddle points with applications for decomposing convex programming problems (Q1069674) (← links)
• Combined subgradient methods for finding saddle points (Q1333646) (← links)
• Monotone \(\varepsilon\)-subgradient method for finding saddle points of convex-concave functions (Q1333702) (← links)
• A combined relaxation method for variational inequalities with nonlinear constraints (Q1380930) (← links)
• Finite algorithm to find the saddle point of a quadratic function subject to linear constraints (Q1899539) (← links)
• Saddle points of rational functions (Q2307710) (← links)
• On the saddlepoint values of non-necessarily coercive convex-concave functions. (Q3983135) (← links)