Search results
Results From The WOW.Com Content Network
Convex optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets (or, equivalently, maximizing concave functions over convex sets). Many classes of convex optimization problems admit polynomial-time algorithms, [1] whereas mathematical optimization is in general NP-hard. [2 ...
A concave mirror, or converging mirror, has a reflecting surface that is recessed inward (away from the incident light). Concave mirrors reflect light inward to one focal point. They are used to focus light. Unlike convex mirrors, concave mirrors show different image types depending on the distance between the object and the mirror.
A convex secondary mirror is placed just to the side of the light entering the telescope, and positioned afocally so as to send parallel light on to the tertiary. The concave tertiary mirror is positioned exactly twice as far to the side of the entering beam as was the convex secondary, and its own radius of curvature distant from the secondary.
The method of images (or method of mirror images) is a mathematical tool for solving differential equations, in which boundary conditions are satisfied by combining a solution not restricted by the boundary conditions with its possibly weighted mirror image. Generally, original singularities are inside the domain of interest but the function is ...
To tackle this problem, optimal-transport-based is one of the existing proposed methods to control caustic pattern by redirecting light's directions as it propagates through the surface of a certain transparent material. This is done by solving an inverse optimization problem based on optimal transport.
The image in a plane mirror is not magnified (that is, the image is the same size as the object) and appears to be as far behind the mirror as the object is in front of the mirror. A diverging lens (one that is thicker at the edges than the middle) or a concave mirror forms a virtual image. Such an image is reduced in size when compared to the ...
Alhazen's problem, also known as Alhazen's billiard problem, is a mathematical problem in geometrical optics first formulated by Ptolemy in 150 AD. [1] It is named for the 11th-century Arab mathematician Alhazen ( Ibn al-Haytham ), who presented a geometric solution in his Book of Optics .
An example Bongard problem, the common factor of the left set being convex shapes (the right set are instead all concave). A Bongard problem is a kind of puzzle invented by the Soviet computer scientist Mikhail Moiseevich Bongard (Михаил Моисеевич Бонгард, 1924–1971), probably in the mid-1960s.