THE METHOD OF FEASIBLE DIRECTIONS FOR OPTIMIZATION PROBLEMS WITH SUBDIFFERENTIABLE OBJECTIVE FUNCTIONBEER K.1980; LECTURE NOTES CONTROL INFORM. SCI.; DEU; DA. 1980; NO 23; PP. 43-51; BIBL. 10 REF.Conference Paper

EINE ERWEITERUNG DER VERFAHREN DER ZULAESSIGEN RICHTUNGEN = UNE EXTENSION DES METHODES DE DIRECTIONS REALISABLESFREYTAG J; GROSSMANN C.1978; MATH. OPER.-FORSCH. STATIST., OPTIMIZ.; DDR; DA. 1978; VOL. 9; NO 4; PP. 569-577; ABS. ENG/RUS; BIBL. 7 REF.Article

NONLINEAR PROGRAMMING WITH CUMULATIVELY BOUNDED VARIABLESMAVRIDES LP.1979; J. COMPUT. APPL. MATH.; BEL; DA. 1979; VOL. 5; NO 3; PP. 163-169; BIBL. 9 REF.Article

A SIMPLIFIED TEST FOR OPTIMALITYABRAMS R; KERZNER L.1978; J. OPTIMIZ. THEORY APPL.; USA; DA. 1978; VOL. 25; NO 1; PP. 161-170; BIBL. 5 REF.Article

A FINITELY SOLVABLE CLASS OF APPROXIMATING PROBLEMS.MEYER GGL.1977; S.I.A.M. J. CONTROL OPTIMIZ.; U.S.A.; DA. 1977; VOL. 15; NO 3; PP. 400-406; BIBL. 10 REF.Article

NEW CONVERGENCE THEOREMS FOR A CLASS OF FEASIBLE DIRECTIONS ALGORITHMSPOLAK E; TISHYADHIGAMA S; MAYNE DQ et al.1982; J. OPTIM. THEORY APPL.; ISSN 0022-3239; USA; DA. 1982; VOL. 37; NO 1; PP. 33-44; BIBL. 18 REF.Article

SEMI-INFINITE PROGRAMMING PROBLEMS AND METHODS OF FEASIBLE DIRECTIONSSCHWARTZ B; TICHATSCHKE R.1981; MATHEMATISCHE OPTIEMIERUNGTHEORIE UND ANWENDUNGEN. INTERNATIONALE TAGUNG/1981/EISENACH; DDR; DA. 1981; PP. 150-153; BIBL. 12 REF.Conference Paper

FEASIBLE DIRECTION METHODS IN THE ABSENCE OF SLATER'S CONDITIONZLOBEC S.1978; MATH. OPER.-FORSCH. STATIST., OPTIMIZ.; DDR; DA. 1978; VOL. 9; NO 2; PP. 185-196; ABS. GER/RUS; BIBL. 21 REF.Article

METHODES STOCHASTIQUES DE MINIMISATION DES FONCTIONS NON DIFFERENTIABLESGUPAL AM.1979; AVTOMAT. I TELEMEKH.; SUN; DA. 1979; NO 4; PP. 61-66; ABS. ENG; BIBL. 10 REF.Article

A GENERAL EXTREMUM PRINCIPLE FOR OPTIMIZATION PROBLEMSALTMAN M.1979; NONLINEAR ANAL., THEORY METHODS APPL.; GBR; DA. 1979; VOL. 3; NO 6; PP. 891-895; BIBL. 8 REF.Article

ACCELERATION DE LA CONVERGENCE DANS LA RESOLUTION DES PROBLEMES DE MINIMAXTARASOV VN.1977; VEST. LENINGRAD. UNIV.; S.S.S.R.; DA. 1977; NO 4; PP. 76-79; ABS. ANGL.; BIBL. 4 REF.Article

OPTIMALITY IN CONVEX PROGRAMMING: A FEASIBLE DIRECTIONS APPROACH = OPTIMALITE EN PROGRAMMATION CONVEXE: UNE APPROCHE A L'AIDE DES DIRECTIONS REALISABLESBEN ISRAEL A; BEN TAL A; ZLOBEC S et al.1982; MATH. PROGRAM. STUDY; ISSN 0303-3929; NLD; DA. 1982; VOL. 19; PP. 16-38; BIBL. 40 REF.Article

A METHOD OF CENTERS ALGORITHM FOR CERTAIN MINIMAX PROBLEMSCHANEY RW.1982; MATH. PROGRAM.; ISSN 0025-5610; NLD; DA. 1982; VOL. 22; NO 2; PP. 202-226; BIBL. 17 REF.Article

A TWO-STAGE FEASIBLE DIRECTION ALGORITHM INCLUDING VARIABLE METRIC TECHNIQUES FOR NONLINEAR OPTIMIZATION PROBLEMSHERSKOVITS JOSE.1982; ; FRA; DA. 1982; INRIA/118; 42 P.; 30 CM; ABS. FRE; BIBL. 15 REF.; RAPPORTS DE RECHERCHE; 118;[RAPP. RECH.-I.N.R.I.A.; ISSN 0249-6399; NO 118]Report

DISCRETE PROCEDURES OF ECONOMIC PLANNING: A UNIFIED VIEW FROM FEASIBLE DIRECTION METHODS.OTSUKI M.1978; REV. ECON. STUDIES; G.B.; DA. 1978; VOL. 45; NO 139; PP. 77-84; BIBL. 10 REF.Article

OPTIMIZATION UNDER NONNEGATIVITY CONSTRAINTS.MAVRIDES LP.1977; NUMER. MATH.; DTSCH.; DA. 1977; VOL. 28; NO 3; PP. 287-293; BIBL. 5 REF.Article

SUR UN ALGORITHME DE DECOMPOSITION DE LA PROGRAMMATION LINEAIRESHMYREVA NV.1977; OPTIMIZACIJA; SUN; DA. 1977; NO 19; PP. 100-115; BIBL. 6 REF.Article

TO THE CONVERGENCE CHARACTERISTIC OF SOME ITERATIVE PROCESSES OF CONVEX OPTIMIZATION = CARACTERISTIQUE DE CONVERGENCE DE QUELQUES PROCESSUS ITERATIFS D'OPTIMISATION CONVEXEKAPLAN AA.1982; MATH. OPERATIONSFORSCH. STAT., SER. OPTIM.; ISSN 0323-3898; DDR; DA. 1982; VOL. 13; NO 3; PP. 409-417; ABS. RUS/GER; BIBL. 3 REF.Article

A SUBGRADIENT ALGORITHM FOR CERTAIN MINIMAX AND MINISUM PROBLEMS. THE CONSTRAINED CASE = UN ALGORITHME DU SOUS-GRADIENT POUR CERTAINS PROBLEMES DE MINIMAX ET DE MINISOMME. LE CAS SOUS CONTRAINTESCHATELON J; HEARN D; LOWE TJ et al.1982; SIAM J. CONTROL OPTIM.; ISSN 0363-0129; USA; DA. 1982; VOL. 20; NO 4; PP. 455-469; BIBL. 37 REF.Article

RESOLUTION DES PROBLEMES DE COMMANDE OPTIMALE AVEC DES CONTRAINTES DE PHASE SOUS FORME D'INEGALITES A L'EXTREMITE DROITESROCHKO VA.1979; UPRAVL. SISTEMY; SUN; DA. 1979; NO 19; PP. 65-77; BIBL. 12 REF.Article

METHODS OF FEASIBLE DIRECTIONS WITH INCREASED GRADIENT MEMORY.MEYER GGL.1978; LECTURE NOTES CONTROL INFORM. SCI.; GERM.; DA. 1978; VOL. 7; PP. 87-93; BIBL. 10 REF.; (OPTIMIZATION TECH. IFIP CONF. 8. PROC. II; WUERZBURG; 1977)Conference Paper

ON FINDING THE MAXIMAL RANGE OF VALIDITY OF A CONSTRAINED SYSTEMGAL S; BACHELIS B; BEN TAL A et al.1978; S.I.A.M. J. CONTROL OPTIMIZ.; USA; DA. 1978; VOL. 16; NO 3; PP. 473-503; BIBL. 9 REF.Article

METHODE DE CALCUL DES POINTS STATIONNAIRES DU PROBLEME GENERAL DE PROGRAMMATION NON LINEAIREBOGOMOLOV NA; KARMANOV VG.1977; ZH. VYCHISLIT. MAT. MAT. FIZ.; S.S.S.R.; DA. 1977; VOL. 17; NO 1; PP. 72-78; BIBL. 4 REF.Article

EIN VERFAHREN DER ZULAESSIGEN RICHTUNGEN FUER DAS LINEARE KONTINUIERLICHE TSCHEBYSCHEFF-PROBLEM = UNE METHODE DES DIRECTIONS REALISABLES POUR LE PROBLEME DE TCHEBYSCHEV CONTINU LINEAIRETICHATSCHKE R; SCHWARTZ B.1982; MATHEMATISCHE OPERATIONSFORSCHUNG UND STATISTIK. SERIES OPTIMIZATION; ISSN 0323-3898; DDR; DA. 1982; VOL. 13; NO 4; PP. 501-509; ABS. ENG/RUS; BIBL. 10 REF.Article

AN ALGORITHM FOR THE MINIMAX WEBER PROBLEMJACOBSEN SK.1981; EUROP. J. OPER. RES.; ISSN 0377-2217; NLD; DA. 1981; VOL. 6; NO 2; PP. 144-148; BIBL. 7 REF.Article