kw.\*:("Convex programming")
Results 1 to 25 of 2915
Selection :
Approximate search for a global minimum in problems of mathematical programming that are close to convexVOLOSHINOV, V. V; LEVITIN, E. S.Computational mathematics and mathematical physics. 1999, Vol 39, Num 3, pp 365-396, issn 0965-5425Article
Approximate first-order and second-order directional derivatives of a marginal function in convex optimizationHIRIART-URRUTY, J.-B.Journal of optimization theory and applications. 1986, Vol 48, Num 1, pp 127-140, issn 0022-3239Article
Perturbed convex programming in reflexive Banach spacesTRUDZIK, L. I.Nonlinear analysis. 1985, Vol 9, Num 1, pp 61-78, issn 0362-546XArticle
Successive approximation in separable programming: an improved procedure for convex separable programsTHAKUR, L. S.Naval research logistics quarterly. 1986, Vol 33, Num 2, pp 325-358, issn 0028-1441Article
Algorithme de programmation convexe, utilisant la fonction de Lagrange modifiéeMARKECHKO, M. I.Avtomatika i telemehanika. 1984, Num 7, pp 100-107, issn 0005-2310Article
KUHN―TUCKER CONDITIONS FOR A CONVEX PROGRAMMING PROBLEM IN BANACH SPACES PARTIALLY ORDERED BY CONE WITH EMPTY INTERIORAHMETOGLU, Feyzullah.Numerical functional analysis and optimization. 2012, Vol 33, Num 4-6, pp 363-373, issn 0163-0563, 11 p.Article
A note on finite termination of iterative algorithms in mathematical programmingJINCHUAN ZHOU; CHANGYU WANG.Operations research letters. 2008, Vol 36, Num 6, pp 715-717, issn 0167-6377, 3 p.Article
Separating plane algorithms for convex optimizationNURMINSKI, E. A.Mathematical programming. 1997, Vol 76, Num 3, pp 373-391, issn 0025-5610Article
An alternating method for stochastic linear programming with simple recourseLIQUN QI.Mathematical programming study. 1986, Vol 27, pp 183-190, issn 0303-3929Article
Limiting Lagrangians: a primal approachKARNEY, D. F; MORLEY, T. D.Journal of optimization theory and applications. 1986, Vol 48, Num 1, pp 163-174, issn 0022-3239Article
A Greedy algorithm for solving a class of convex programming problems and its connect on with polymatroid theoryMORTON, G; VON RANDOW, R; RINGWALD, K et al.Mathematical programming. 1985, Vol 32, Num 2, pp 238-241, issn 0025-5610Article
In a semi-infinite program only a countable subset of the constraints is essentialKARNEY, D. F.Journal of approximation theory. 1985, Vol 44, Num 1, pp 69-72, issn 0021-9045Article
Quadratic geometric programming with application to machining economicsJEFFERSON, T. R; SCOTT, C. H.Mathematical programming. 1985, Vol 31, Num 2, pp 137-152, issn 0025-5610Article
Pre- and Post-Processing Sum-of-Squares Programs in Practice : POSITIVE POLYNOMIALS IN CONTROLLÖFBERG, Johan.IEEE transactions on automatic control. 2009, Vol 54, Num 5, pp 1007-1011, issn 0018-9286, 5 p.Article
An adaptive incremental approach for the solution of convex programming modelsMAHMOUD, F. F; AL-SAFFAR, A. K; HASSAN, K. A et al.Mathematics and computers in simulation. 1993, Vol 35, Num 6, pp 501-508, issn 0378-4754Article
Convex optimization with prescribed accuracyKULIKOV, A. N; FAZYLOV, V. R.U.S.S.R. computational mathematics and mathematical physics. 1990, Vol 30, Num 3, pp 16-22, issn 0041-5553Article
A condition number for differentiable convex inequalitiesMANGASARIAN, O. L.Mathematics of operations research. 1985, Vol 10, Num 2, pp 175-179, issn 0364-765XArticle
Applications of the method of partial inverses to convex programming: decompositionSPINGARN, J. E.Mathematical programming. 1985, Vol 32, Num 2, pp 199-223, issn 0025-5610Article
A class of rank-two ellipsord algorithms for convex programmingECH-CHERIF, A; ECKER, J. G.Mathematical programming. 1984, Vol 29, Num 2, pp 187-202, issn 0025-5610Article
Duality inequalities as a numerical aidDUFFIN, R. J.Operations research letters. 1984, Vol 3, Num 2, pp 65-68, issn 0167-6377Article
Characterizing an optimal input in perturbed convex programming: corrigendumZLOBEC, S.Mathematical programming. 1986, Vol 35, Num 3, pp 368-371, issn 0025-5610Article
On the quadratic programming algorithm of Goldfarb and IdnaniPOWELL, M. J. D.Mathematical programming study. 1985, Num 25, pp 46-61, issn 0303-3929Article
A hybrid algorithm for solving convexe separable network flow problemsBELLING-SEIB, K.Zeitschrift für Operations Research. 1985, Vol 29, Num 3, pp 105-123, issn 0373-790XArticle
Directional derivative of a minimax functionCORREA, R; SEEGER, A.Nonlinear analysis. 1985, Vol 9, Num 1, pp 13-22, issn 0362-546XArticle
Problèmes de programmation convexe généralisée avec des préférences linéairesYUDIN, A. D; TSOJ, EH. V.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1985, Num 2, pp 34-41, issn 0002-3388Article