Serveur d'exploration sur l'Université de Trèves - Checkpoint (Istex)

Index « Titre (en) » - entrée « solving »
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.
solver < solving < somatoform  Facettes :

List of bibliographic references

Number of relevant bibliographic references: 13.
Ident.Authors (with country if any)Title
000884 (2005) Friedemann Leibfritz [Allemagne]Static Output Feedback ℋ︁∞–Synthesis by solving the ℋ︁∞–NSDP
000B08 (2003) G. Still [Pays-Bas]Approximation theory methods for solving elliptic eigenvalue problems
000B40 (2002) Joseph H. Astrachan ; Sabine B. Klein ; Kosmas X. SmyrniosThe F-PEC Scale of Family Influence: A Proposal for Solving the Family Business Definition Problem1
001036 (1996) A. Kaplan [Allemagne] ; R. Tichatschke [Allemagne]Path-following proximal approach for solving Ill-posed convex semi-infinite programming problems
001080 (1996) Reiner Horst [Allemagne] ; Nguyen Van Thoai [Allemagne]A new algorithm for solving the general quadratic programming problem
001266 (1994) R. Horst [Allemagne] ; L. D. Muu [Viêt Nam] ; M. Nast [Allemagne]Branch-and-bound decomposition approach for solving quasiconvex-concave programs
001343 (1993) N. Van Thoai [Allemagne]Canonical D. C. programming techniques for solving a convex program with an additional constraint of multiplicative type
001485 (1991) R. Horst [Allemagne] ; T. Q. Phong [Viêt Nam] ; Ng. V. Thoai [Viêt Nam] ; J. De Vries [Allemagne]On solving a D.C. programming problem by a sequence of linear programs
001508 (1991) Nguyen Van Thoai [Allemagne]A global optimization approach for solving the convex multiplicative programming problem
001557 (1990) Reiner Horst [Allemagne] ; Thai Q. Phong [Viêt Nam] ; Nguyen V. ThoaiOn solving general reverse convex programming problems by a sequence of linear programs and line searches
001610 (1989) R. Horst [Allemagne] ; N. V. Thoai [Viêt Nam]Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
001662 (1988) R. Horst [Allemagne] ; Ng V. Thoai [Viêt Nam]Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
001A44 (1970) Norma Sleight [États-Unis]An Easy Method of Solving Trigonometric Inequalities

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Checkpoint
HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/Title.i -k "solving" 
HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/Title.i  \
                -Sk "solving" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd 

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

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    Istex
   |étape=   Checkpoint
   |type=    indexItem
   |index=    Title.i
   |clé=    solving
}}

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