Pages that link to "Item:Q1365044"

The following pages link to How to deal with the unbounded in optimization: Theory and algorithms (Q1365044):

Displaying 15 items.

• Asymptotical good behavior on inequalities with completely approximate K-T concept (Q435757) (← links)
• Smoothing methods for nonsmooth, nonconvex minimization (Q715249) (← links)
• Existence of global minima for constrained optimization (Q857595) (← links)
• Set intersection theorems and existence of optimal solutions (Q879966) (← links)
• A bundle-filter method for nonsmooth convex constrained optimization (Q959944) (← links)
• Convex analysis can be helpful for the asymptotic analysis of monotone operators (Q959952) (← links)
• On boundedness of (quasi-)convex integer optimization problems (Q999128) (← links)
• A metric approach to asymptotic analysis. (Q1416510) (← links)
• Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems (Q1594871) (← links)
• A further study on asymptotic functions via variational analysis (Q2315268) (← links)
• Noncoercive stationary Navier-Stokes equations of heat-conducting fluids modeled by hemivariational inequalities: an equilibrium problem approach (Q2323068) (← links)
• Dynamic bundle methods (Q2390994) (← links)
• On generalizations of the Frank-Wolfe theorem to convex and quasi-convex programmes (Q2506181) (← links)
• Convergence of asymptotic directions (Q2723466) (← links)
• From solvability and approximation of variational inequalities to solution of nondifferentiable optimization problems in contact mechanics (Q2808312) (← links)