Results 241 to 250 of about 22,797 (304)
Integer programming for learning directed acyclic graphs from nonidentifiable Gaussian models. [PDF]
BiometrikaXu T +3 more
europepmc +1 more source
, 2013 Convex programming is the simplest and best processed area of nonlinear programming. Many properties of linear programs are transmitted to the convex programs. In this paper properties of convex programs and methods for their solution like gradient method and method of convergence are listed, also an example of solving convex program is given.
Karamazova Gelova, Elena +3 more
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Convex programming for disjunctive convex optimization
Mathematical Programming, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sebastián Ceria, João Soares
openaire +1 more source
Sequential Difference-of-Convex Programming
Journal of Optimization Theory and Applications, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
On A characterization of optimality in convex programming
Mathematical Programming, 1976Necessary and sufficient conditions for optimality are given, for convex programming problems, without constraint qualification, in terms of a single mathematical program, which can be chosen to be bilinear.
Adi Ben-Israel, Aharon Ben-Tal
openaire +2 more sources
SIAM Journal on Optimization, 2010
Random convex programs (RCPs) are convex optimization problems subject to a finite number $N$ of random constraints. The optimal objective value $J^*$ of an RCP is thus a random variable. We study the probability with which $J^*$ is no longer optimal if a further random constraint is added to the problem (violation probability, $V^*$).
openaire +2 more sources
Random convex programs (RCPs) are convex optimization problems subject to a finite number $N$ of random constraints. The optimal objective value $J^*$ of an RCP is thus a random variable. We study the probability with which $J^*$ is no longer optimal if a further random constraint is added to the problem (violation probability, $V^*$).
openaire +2 more sources
CONVEX: A COMPUTER PROGRAM FOR SOLVING CONVEX PROGRAMS
1970Abstract : The report describes a computer program implementing the Hartley- Hocking convex programming algorithm. The two parts of this report are, respectively, a description of the Hartley-Hocking method as extracted from the original paper, and the documentation of the computer program.
H. H. Oxspring +3 more
openaire +1 more source
On the convex programming approach to linear programming
Operations Research Letters, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
J. R. Rajasekera, Shu-Cherng Fang
openaire +2 more sources
1987
Abstract This is the second of five chapters on optimal programming (the typical mathematics of economics) and related issues as related to choice making. It introduces convexity conditions, and shows where they have effect, together with Slater's condition, in assuring the existence of a support to the limit function, so providing ...
openaire +2 more sources
Abstract This is the second of five chapters on optimal programming (the typical mathematics of economics) and related issues as related to choice making. It introduces convexity conditions, and shows where they have effect, together with Slater's condition, in assuring the existence of a support to the limit function, so providing ...
openaire +2 more sources