PascalFr.i
Exploration
Accueil
Racine
Exploration
Accueil
Racine

Serveur d'exploration sur l'Université de Trèves - Exploration (Accueil)

Index « PascalFr.i » - entrée « Programmation non convexe »
Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.
Programmation multiplicative fractionnaire < Programmation non convexe < Programmation non linéaire  Facettes :

List of bibliographic references indexed by Programmation non convexe

Number of relevant bibliographic references: 11.
Ident.Authors (with country if any)Title
000D52 (2010) R. Horst [Allemagne]Bisecton by Global Optimization Revisited
001D14 (2002) N. V. Thoai [Allemagne]Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
002079 (1999) Reiner Horst [Allemagne] ; Nguyen V. Thoai [Allemagne]Maximizing a concave function over the efficient or weakly-efficient set
002183 (1999) R. Horst [Allemagne] ; N. V. Thoai [Allemagne]DC programming : Overview
002192 (1999) M. Gugat [Allemagne]A parametric view on the Mangasarian-Fromovitz constraint qualification
002288 (1998) Nguyen V. Thoai [Allemagne]On Tikhonov's Reciprocity Principle and Optimality Conditions in d.c. Optimization
002575 (1997) M. Dür [Allemagne] ; R. Horst [Allemagne]Lagrange duality and partitioning techniques in nonconvex global optimization
002F23 (1991) R. Horst [Allemagne] ; N. V. Thoai ; H. P. BensonConcave minimization via conical partitions and polyhedral outer approximation
003081 (1989) R. Horst [Allemagne]On consistency of bounding operations in deterministic global optimization
003158 (1988) R. Horst [Allemagne]Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reverse convex constraints, DC-programming, and Lipschitzian optimization
003323 (1986) R. Horst [Allemagne]A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Exploration

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/PascalFr.i -k "Programmation non convexe" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/PascalFr.i  \
                -Sk "Programmation non convexe" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    Main
   |étape=   Exploration
   |type=    indexItem
   |index=    PascalFr.i
   |clé=    Programmation non convexe
}}
Wicri

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024