Generalized -univex -set functions and parametric duality models in minmax fractional subset programming.
Generalized vector quasi-equilibrium problems with set-valued mappings.
Integer programming approaches for minimum stabbing problems
The problem of finding structures with minimum stabbing number has received considerable attention from researchers. Particularly, [10] study the minimum stabbing number of perfect matchings (mspm), spanning trees (msst) and triangulations (mstr) associated to set of points in the plane. The complexity of the mstr remains open whilst the other two are known to be 𝓝𝓟-hard. This paper presents integer programming (ip) formulations for these three problems, that allowed us to...
Minimax equalities by reconstruction of polytopes.
Minmax regret combinatorial optimization problems: an Algorithmic Perspective
Uncertainty in optimization is not a new ingredient. Diverse models considering uncertainty have been developed over the last 40 years. In our paper we essentially discuss a particular uncertainty model associated with combinatorial optimization problems, developed in the 90's and broadly studied in the past years. This approach named minmax regret (in particular our emphasis is on the robust deviation criteria) is different from the classical approach for handling uncertainty, stochastic approach,...
Minmax regret combinatorial optimization problems: an Algorithmic Perspective
Uncertainty in optimization is not a new ingredient. Diverse models considering uncertainty have been developed over the last 40 years. In our paper we essentially discuss a particular uncertainty model associated with combinatorial optimization problems, developed in the 90's and broadly studied in the past years. This approach named minmax regret (in particular our emphasis is on the robust deviation criteria) is different from the classical approach for handling uncertainty, stochastic approach,...
Monotone interval eigenproblem in max–min algebra
The interval eigenproblem in max-min algebra is studied. A classification of interval eigenvectors is introduced and six types of interval eigenvectors are described. Characterization of all six types is given for the case of strictly increasing eigenvectors and Hasse diagram of relations between the types is presented.
Nonsmooth equations approach to a constrained minimax problem
An equivalent model of nonsmooth equations for a constrained minimax problem is derived by using a KKT optimality condition. The Newton method is applied to solving this system of nonsmooth equations. To perform the Newton method, the computation of an element of the -differential for the corresponding function is developed.
On a modification of Rényi's traffic model
On Ky Fan's minimax inequalities, mixed equilibrium problems and hemivariational inequalities.
On the convergence of min/sup points in optimal control problems.
On the weak robustness of fuzzy matrices
A matrix in -algebra (fuzzy matrix) is called weakly robust if is an eigenvector of only if is an eigenvector of . The weak robustness of fuzzy matrices are studied and its properties are proved. A characterization of the weak robustness of fuzzy matrices is presented and an algorithm for checking the weak robustness is described.
Optimal control characteristics of a queueing system with batch services
Optimality and Duality for a Class of Nondifferentiable Minimax Fractional Programming Problems
Primal interior point method for minimization of generalized minimax functions
In this paper, we propose a primal interior-point method for large sparse generalized minimax optimization. After a short introduction, where the problem is stated, we introduce the basic equations of the Newton method applied to the KKT conditions and propose a primal interior-point method. (i. e. interior point method that uses explicitly computed approximations of Lagrange multipliers instead of their updates). Next we describe the basic algorithm and give more details concerning its implementation...
Primal interior-point method for large sparse minimax optimization
In this paper, we propose a primal interior-point method for large sparse minimax optimization. After a short introduction, the complete algorithm is introduced and important implementation details are given. We prove that this algorithm is globally convergent under standard mild assumptions. Thus the large sparse nonconvex minimax optimization problems can be solved successfully. The results of extensive computational experiments given in this paper confirm efficiency and robustness of the proposed...
Production games, core deficit, duality and shadow prices
Considered here are production (or market) games with transferable utility. Prime objects are explicitly computable core solutions, or somewhat "deficit" versions of such, fully defined by shadow prices. Main arguments revolve around standard Lagrangian duality. A chief concern is to relax, or avoid, the commonplace assumption that all preferences and production possibilities be convex. Doing so, novel results are obtained about non-emptiness of the core, and about specific imputations therein.
Recursive form of general limited memory variable metric methods
In this report we propose a new recursive matrix formulation of limited memory variable metric methods. This approach can be used for an arbitrary update from the Broyden class (and some other updates) and also for the approximation of both the Hessian matrix and its inverse. The new recursive formulation requires approximately multiplications and additions per iteration, so it is comparable with other efficient limited memory variable metric methods. Numerical experiments concerning Algorithm...
Second-order differential proximal methods for equilibrium problems.
Shape optimization of piezoelectric sensors or actuators for the control of plates
This paper deals with a new method to control flexible structures by designing non-collocated sensors and actuators satisfying a pseudo-collocation criterion in the low-frequency domain. This technique is applied to a simply supported plate with a point force actuator and a piezoelectric sensor, for which we give some theoretical and numerical results. We also compute low-order controllers which stabilize pseudo-collocated systems and the closed-loop behavior show that this approach is very promising....