In mathematics, a Diophantine equation is an equation, typically a polynomial equation in two or more unknowns with integer coefficients, such that the only solutions of interest are the integer ones. A linear Diophantine equation equates to a constant the sum of two or more monomials, each of degree one. An exponential Diophantine equation is one in which unknowns can appear in exponents.
Mathematical optimization or mathematical programming is the selection of a best element, with regard to some criterion, from some set of available alternatives. It is generally divided into two subfields: discrete optimization and continuous optimization. Optimization problems of sorts arise in all quantitative disciplines from computer science and engineering to operations research and economics, and the development of solution methods has been of interest in mathematics for centuries.
Dušan D. Repovš is a Slovenian mathematician from Ljubljana, Slovenia.
Pierre-Louis Lions is a French mathematician. He is known for a number of contributions to the fields of partial differential equations and the calculus of variations. He was a recipient of the 1994 Fields Medal and the 1991 Prize of the Philip Morris tobacco and cigarette company.
Mathematics in China emerged independently by the 11th century BCE. The Chinese independently developed a real number system that includes significantly large and negative numbers, more than one numeral system, algebra, geometry, number theory and trigonometry.
Interior-point methods are a certain class of algorithms that solve linear and nonlinear convex optimization problems.
Anatoly Mykhailovych Samoilenko was a Ukrainian mathematician, an Academician of the National Academy of Sciences of Ukraine, the Director of the Institute of Mathematics of the National Academy of Sciences of Ukraine.
In numerical mathematics, relaxation methods are iterative methods for solving systems of equations, including nonlinear systems.
ABS methods, where the acronym contains the initials of Jozsef Abaffy, Charles G. Broyden and Emilio Spedicato, have been developed since 1981 to generate a large class of algorithms for the following applications:
The term "auction algorithm" applies to several variations of a combinatorial optimization algorithm which solves assignment problems, and network optimization problems with linear and convex/nonlinear cost. An auction algorithm has been used in a business setting to determine the best prices on a set of products offered to multiple buyers. It is an iterative procedure, so the name "auction algorithm" is related to a sales auction, where multiple bids are compared to determine the best offer, with the final sales going to the highest bidders.
Jenő Elek Egerváry was a Hungarian mathematician.
Charles George Broyden was a mathematician who specialized in optimization problems and numerical linear algebra. While a physicist working at English Electric Company from 1961–1965, he adapted the Davidon–Fletcher–Powell formula to solving some nonlinear systems of equations that he was working with, leading to his widely cited 1965 paper, "A class of methods for solving nonlinear simultaneous equations". He was a lecturer at UCW Aberystwyth from 1965–1967. He later became a senior lecturer at University of Essex from 1967–1970, where he independently discovered the Broyden–Fletcher–Goldfarb–Shanno (BFGS) method. The BFGS method has then become a key technique in solving nonlinear optimization problems. Moreover, he was among those who derived the symmetric rank-one updating formula, and his name was also attributed to Broyden's methods and Broyden family of quasi-Newton methods. After leaving the University of Essex, he continued his research career in the Netherlands and Italy, being awarded the chair at University of Bologna. In later years, he began focusing on numerical linear algebra, in particular conjugate gradient methods and their taxonomy.
Eldon Robert Hansen is an American mathematician and author who has published in global optimization theory and interval arithmetic.
Adi Ben-Israel is a mathematician and an engineer, working in applied mathematics, optimization, statistics, operations research and other areas. He is a Professor of Operations Research at Rutgers University, New Jersey.
MINOS is a Fortran software package for solving linear and nonlinear mathematical optimization problems. MINOS may be used for linear programming, quadratic programming, and more general objective functions and constraints, and for finding a feasible point for a set of linear or nonlinear equalities and inequalities.
Artelys Knitro is a commercial software package for solving large scale nonlinear mathematical optimization problems.
Kuṭṭaka is an algorithm for finding integer solutions of linear Diophantine equations. A linear Diophantine equation is an equation of the form ax + by = c where x and y are unknown quantities and a, b, and c are known quantities with integer values. The algorithm was originally invented by the Indian astronomer-mathematician Āryabhaṭa and is described very briefly in his Āryabhaṭīya. Āryabhaṭa did not give the algorithm the name Kuṭṭaka, and his description of the method was mostly obscure and incomprehensible. It was Bhāskara I who gave a detailed description of the algorithm with several examples from astronomy in his Āryabhatiyabhāṣya, who gave the algorithm the name Kuṭṭaka. In Sanskrit, the word Kuṭṭaka means pulverization, and it indicates the nature of the algorithm. The algorithm in essence is a process where the coefficients in a given linear Diophantine equation are broken up into smaller numbers to get a linear Diophantine equation with smaller coefficients. In general, it is easy to find integer solutions of linear Diophantine equations with small coefficients. From a solution to the reduced equation, a solution to the original equation can be determined. Many Indian mathematicians after Aryabhaṭa have discussed the Kuṭṭaka method with variations and refinements. The Kuṭṭaka method was considered to be so important that the entire subject of algebra used to be called Kuṭṭaka-ganita or simply Kuṭṭaka. Sometimes the subject of solving linear Diophantine equations is also called Kuṭṭaka.
Nonlinear algebra is the nonlinear analogue to linear algebra, generalizing notions of spaces and transformations coming from the linear setting. Algebraic geometry is one of the main areas of mathematical research supporting nonlinear algebra, while major components coming from computational mathematics support the development of the area into maturity.
Ferenc Forgó (born 16 April 1942 in Pécs) is a Hungarian economist and mathematician. He is a Doctor of the Hungarian Academy of Sciences and professor emeritus at the Corvinus University of Budapest. His main research interests have been mathematical programming and game theory.
