Nonsmooth nonconvex global optimization in a Banach space with a basis

Authors:
A. Balbás;E. Galperin;P. Jiménez Guerra
Affiliations:
-;-;-
Venue:
Computers & Mathematics with Applications
Year:
2004

Citing 4
Cited 1

Entropy-like proximal methods in convex programming

Mathematics of Operations Research
Convergence of some algorithms for convex minimization

Mathematical Programming: Series A and B - Special issue: Festschrift in Honor of Philip Wolfe part II: studies in nonlinear programming
Convergence of the steepest descent method for minimizing quasiconvex functions

Journal of Optimization Theory and Applications
On the projected subgradient method for nonsmooth convex optimization in a Hilbert space

Mathematical Programming: Series A and B

Non-causal models in long term planning via set contractive optimal control methods

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.09

Visualization

Abstract

Following paper [1), significant improvements are proposed as concerns the class of problems that can be solved, the quality of the solution, and the numerical implementability of the method. Optimization is considered in a Banach space over a nonconvex inf-compact, finitely infrobust set for a multivalued nonconvex continuous functional. The iterative method is monotonic and represents generalized variant o@$ setwise descent onto the set of all global minimizers. A real-life example of the vertical soft landing of an aircraft is considered to illustrate the method.