Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=25948591

OPTIMALITY CONDITIONS AND DUALITY IN NONSMOOTH SEMIINFINITE PROGRAMMING

Author
ZALMAI, G. J1 ; QINGHONG ZHANG1
[1] Department of Mathematics and Computer Science, Northern Michigan University, Marquette, Michigan, United States
Source

Numerical functional analysis and optimization. 2012, Vol 33, Num 4-6, pp 452-472, 21 p ; ref : 56 ref

CODEN
NFAODL
ISSN
0163-0563
Scientific domain
Control theory, operational research; Mathematics
Publisher
Taylor & Francis, Philadelphia, PA
Publication country
United States
Document type
Article
Language
English
Author keyword
90C26 90C30 90C34 Dual problems Duality theorems Generalized gradient Lipschitz function Necessary optimality conditions Nonsmooth function Semiinfinite programming Sufficient optimality conditions
Keyword (fr)
Condition nécessaire Condition optimalité Condition suffisante Dualité Fonction Lipschitz Programmation
Keyword (en)
Necessary condition Optimality condition Sufficient condition Duality Lipschitz function Programming
Keyword (es)
Condición necesaria Condición optimalidad Condición suficiente Dualidad Función Lipschitz Programación
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02I Numerical analysis. Scientific computation / 001A02I01 Numerical analysis / 001A02I01P Numerical methods in mathematical programming, optimization and calculus of variations / 001A02I01P1 Numerical methods in mathematical programming

Discipline
Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
25948591

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web