Pages that link to "Item:Q4700278"
From MaRDI portal
The following pages link to Lipschitz programming via increasing convex-along-rays functions<sup>*</sup> (Q4700278):
Displaying 12 items.
- An approach to the subproblem of the cutting angle method of global optimization (Q813345) (← links)
- Least squares splines with free knots: Global optimization approach. (Q1426188) (← links)
- Convex minimization under Lipschitz constraints (Q1823144) (← links)
- Critical duality (Q2481108) (← links)
- Local optimization method with global multidimensional search (Q2576444) (← links)
- An alogrithm for monotonic global optimization problems<sup>∗</sup> (Q2720273) (← links)
- On the global minimization of increasing positively homogeneous functions over the unit simplex (Q3056409) (← links)
- Comparative analysis of the cutting angle and simulated annealing methods in global optimization (Q4467167) (← links)
- Abstract convexity:examples and applications (Q4949174) (← links)
- Generalized cutting plane method for solving nonlinear stochastic programming problems (Q5131826) (← links)
- A multidimensional descent method for global optimization (Q5193141) (← links)
- Multipliers and general Lagrangians (Q5317740) (← links)