Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Méthode descente")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 634

  • Page / 26
Export

Selection :

  • and

Computation of descent directions in stochastic optimization problems with invariant distributionsMARTI, K.Zeitschrift für angewandte Mathematik und Mechanik. 1985, Vol 65, Num 8, pp 355-378, issn 0044-2267Article

On a global descent method for polynomialsRUSCHEWEYH, S.Numerische Mathematik. 1984, Vol 45, Num 2, pp 227-240, issn 0029-599XArticle

SOLUTION APPROCHEE DES PROBLEMES VARIATIONNELSFEDORENKO RP.1974; ZH. VYCHISLIT. MAT. MAT. FIZ.; S.S.S.R.; DA. 1974; VOL. 14; NO 3; PP. 652-668; BIBL. 14 REF.Article

Coupling the auxiliary problem principle with descent methods of pseudoconvex programmingDAOLI ZHU; MARCOTTE, P.European journal of operational research. 1995, Vol 83, Num 3, pp 670-685, issn 0377-2217Article

Computer experiments to find the minimum lower unity of a monotone boolean functionUSTYUZHANINOV, V. G.U.S.S.R. computational mathematics and mathematical physics. 1990, Vol 30, Num 4, pp 196-203, issn 0041-5553Article

Random search algorithms with sufficient descent for minimization of functionsWARDI, Y.Mathematics of operations research. 1989, Vol 14, Num 2, pp 343-354, issn 0364-765XArticle

A projected Lagrangian algorithm for semi-infinite programmingCOOPE, I. D; WATSON, G. A.Mathematical programming. 1985, Vol 32, Num 3, pp 337-356, issn 0025-5610Article

Feasible descent algorithms for mixed complementarity problemsFERRIS, M. C; KANZOW, C; MUNSON, T. S et al.Mathematical programming. 1999, Vol 86, Num 3, pp 475-497, issn 0025-5610Article

EIN ABSTIEGSVERFAHREN FUER APPROXIMATIONSAUFGABEN IN NORMIERTEN RAEUMEN = UNE METHODE DE DESCENTE POUR DES PROBLEMES D'APPROXIMATION DANS DES ESPACES NORMESSCHULTZ R.1978; NUMER. MATH.; DEU; DA. 1978; VOL. 31; NO 1; PP. 77-95; ABS. ENG; BIBL. 14 REF.Article

DESCENT ALGORITHM FOR THE OPTIMISATION OF BILINEAR SYSTEMS.OWENS DH.1975; ELECTRON. LETTERS; G.B.; DA. 1975; VOL. 11; NO 15; PP. 335-336; BIBL. 2 REF.Article

DESCENT METHODS IN SMOOTH, ROTUND SPACES WITH APPLICATIONS TO APPROXIMATION IN LP. = METHODES DE DESCENTE DANS DES ESPACES TONNELES REGULIERS; APPLICATIONS AUX APPROXIMATIONS DANS LPSULLIVAN FE; ATLESTAM B.1974; J. MATH. ANAL. APPL.; U.S.A.; DA. 1974; VOL. 48; NO 1; PP. 155-164; BIBL. 7 REF.Article

APPLICATION DE LA METHODE DU VECTEUR DE DESCENTE A LA RESOLUTION DES PROBLEMES D'OPTIMISATION DE TYPE COMBINATOIRESERGIENKO IV.1975; UPRAVL. SIST. MACH., U.S.S.R.; S.S.S.R.; DA. 1975; NO 2; PP. 86-94; ABS. ANGL.; BIBL. 25 REF.Article

STABLE MAXIMUM DESCENT: AN IMPROVED METHOD OF REFERENCE MODEL ADAPTIVE CONTROL.GREEN JW; WALKER PH.1974; MEASUR. AND CONTROL; G.B.; DA. 1974; VOL. 7; NO 1; PP. 425-432; BIBL. 7 REF.Article

COMMANDE DECENTRALISEE A INFORMATION INEXACTE, UTILISANT LA METHODE DE LA DESCENTE LA PLUS SIMPLENISNEVICH LB; STETSYURA GG.1972; AVTOMAT. I. TELEMEKH.; S.S.S.R.; DA. 1972; NO 9; PP. 101-108; ABS. ANGL.; BIBL. 4 REF.Serial Issue

SUR LE CALCUL D'UN SYSTEME DE PUITS OPTIMAUX DANS LES PROBLEMES D'ABAISSEMENT DE NIVEAUSHAMANS'KIJ VE.1972; DOP. AKAD. NAUK U.R.S.R., A; S.S.S.R.; DA. 1972; VOL. 34; NO 8; PP. 720-723; ABS. ANGL.; BIBL. 3 REF.Serial Issue

A GENERALIZATION OF THE METHOD OF STEEPEST DESCENTBLEISTEIN N; HANDELSMAN RA.1972; J. INST. MATH. APPL., LONDON; G.B.; DA. 1972; VOL. 10; NO 2; PP. 211-230; BIBL. 9 REF.Serial Issue

PROGRAMME DE RESOLUTION D'UN SYSTEME D'EQUATIONS NON LINEAIRES PAR LA METHODE DE DESCENTE SUIVANT LA PLUS GRANDE PENTE. PROGRAMMES 25TARKASHVILI TS T.1973; IN: SB. STAND. PROGRAMM ALGORITMOV; TBILISI; METSNIEREBA; DA. 1973; PP. 83-92; BIBL. 3 REF.Book Chapter

CURVE FITTING WITH PIECEWISE-LINEAR FUNCTIONS = LISSAGE DE COURBES A L'AIDE DE FONCTIONS LINEAIRES PAR INTERVALLESCANTONI A.1972; PROC. I.R.E.E.; AUSTRAL.; DA. 1972; VOL. 33; NO 9; PP. 417-423; BIBL. 20 REF.Serial Issue

A refined evaluation function for the MinLA problemRODRIGUEZ-TELLO, Eduardo; HAO, Jin-Kao; TORRES-JIMENEZ, Jose et al.Lecture notes in computer science. 2006, pp 392-403, issn 0302-9743, isbn 3-540-49026-4, 1Vol, 12 p.Conference Paper

A general descent framework for the monotone variational inequality problemJIA HAO WU; FLORIAN, M; MARCOTTE, P et al.Mathematical programming. 1993, Vol 61, Num 3, pp 281-300, issn 0025-5610Article

Numerical results for sums of five and seven biquadrates and consequences for sums of 19 biquadratesDESHOUILLERS, J.-M; DRESS, F.Mathematics of computation. 1993, Vol 61, Num 203, pp 195-207, issn 0025-5718Article

Two-point step size gradient methodsBARZILAI, J; BORWEIN, J. M.IMA journal of numerical analysis. 1988, Vol 8, Num 1, pp 141-148, issn 0272-4979Article

A method for the Chebyshev solution of an overdetermined system of complex linear equationsWATSON, G. A.IMA journal of numerical analysis. 1988, Vol 8, Num 4, pp 461-471, issn 0272-4979Article

A method for minimizing the sum of a convex function and a continuously differentiable functionKIWIEL, K. C.Journal of optimization theory and applications. 1986, Vol 48, Num 3, pp 437-449, issn 0022-3239Article

Estimations de la vitesse de convergence pour quelques algorithmes de minimisation de fonctions fortement convexesVITUSHKIN, P. A.Matematičeskij sbornik (Moskva). 1984, Vol 124, Num 3, pp 335-352, issn 0368-8666Article

  • Page / 26