Results 31 to 40 of about 166 (143)
Principles of Extremum and Application to some Problems of Analysis [PDF]
AMS subject classification: 41A17, 41A50, 49Kxx, 90C25.The aim of this paper is to demonstrate applications of a direct approach to the solution of extremal problems to some concrete problems of classical analysis, calculus of variations and ...
Tikhomirov, V.
core
Well-Posedness, Conditioning and Regularization of Minimization, Inclusion and Fixed-Point Problems [PDF]
AMS subject classification: 65K10, 49M07, 90C25, 90C48.Well-posedness, conditioning and regularization of fixed-point problems are studied in connexion with well-posedness, conditioning and Tikhonov regularization of minimization and inclusion problems ...
Lemaire, B.
core
The lagrange approach to infinite linear programs
Infinite linear programs, convex problems, Lagrange approach, strong duality, 90C46, 90C25, 90C08,
Raquiel López-Martínez +2 more
core +1 more source
Central axes and peripheral points in high dimensional directional datasets.
International audienceWe introduce a new notion of central axis for a finite set {a 1 ,. .. , a m } of vectors in R n. In tandem, we discuss different ways of measuring the dispersion of the data points a i 's around the central axis. Finally, we explain
Seeger, Alberto +5 more
core +1 more source
Multiobjective fractional programming with generalized convexity
Multiobjective fractional programming problem, weakly efficient solution, generalized convexity, 90C30, 90C25,
P. Ruíz-Canales +2 more
core +1 more source
A class of r-semipreinvex functions and optimality in nonlinear programming
Semi-connected sets, Semipreinvex functions, r-Semipreinvex functions, Optimality, Nonlinear programming, 90C25, 90C26, 90C30,
Ke Zhao, Zhe Chen, Xue Liu
core +1 more source
On the local metric property for Hüsler–Reiss graphical models
Many multivariate data sets exhibit a form of positive dependence, which can either appear globally between all variables or only locally within particular subgroups.
Röttger Frank, Schmitz Quentin
doaj +1 more source
A PVT-Type Algorithm for Minimizing a Nonsmooth Convex Function [PDF]
2000 Mathematics Subject Classification: 90C25, 68W10, 49M37.A general framework of the (parallel variable transformation) PVT-type algorithm, called the PVT-MYR algorithm, for minimizing a non-smooth convex function is proposed, via the Moreau-Yosida ...
Pang, Li-Ping, Xia, Zun-Quan
core
Counterexamples on some articles on quasi-variational inclusion problems
Upper quasi-variational inclusion, Lower quasi-variational inclusion, Vector optimization problem, Upper and lower C-quasi-convex multi-valued mapping, Upper and lower C-continuous multi-valued mapping, 47H04, 90C25, 90C33, 90C47,
M. Vatandoost, H. Mohebi
core +1 more source
Finding a Strict Feasible Dual Initial Solution for Quadratic Semidefinite Programming
In this paper, we propose an algorithm to comput the dual initial feasible solution for solving a primal-dual optimization problem (convex quadratic semidefinite programming) by a interior point methods.
Lakhdar Djeffal, El Amir Djeffal
core

