Convex optimization is the process of enhancing the vision that convex mirrors and lenses can provide by adjusting the angle of the convex lenses to the perfect most apt angles separating them apart so as to enhance the field of vision and effectiveness.

Aleksandr Moiseevich Rubinov has written:

'Abstract convexity and global optimization' -- subject(s): Convex programming, Mathematical optimization

'Lagrange-type functions in constrained non-convex optimization' -- subject(s): Lagrangian functions, Nonconvex programming

Point method refers a class of algorithms aimed at solving linear and nonlinear convex optimization problems

I. I. Eremin has written:

'Theory of linear optimization' -- subject(s): Convex programming, Linear programming

Andrew Kurdila has written:

'Robust optimization-directed design' -- subject(s): Mathematical optimization, Programming (Mathematics), System theory

'Convex Functional Analysis (Systems & Control)'