The algorithm proposed in Mitsos (Optimization 60(10–11):1291–1308, <CitationRef CitationID="CR17">2011</CitationRef>) for the global optimization of semi-infinite programs is extended to the global optimization of generalized semi-infinite programs. No convexity or concavity assumptions are made. The algorithm employs convergent lower...</citationref>

This paper analytically characterizes certain classes of low-diameter strongly attack-tolerant networks of arbitrary size, which are globally optimal in the sense that they contain the minimum possible number of edges. Strong attack tolerance property of level <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$R$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mi>R</mi> </math> </EquationSource> </InlineEquation> implies that a...</equationsource></equationsource></inlineequation>

The paper deals with the problem of characterizing Pareto optima (efficient solutions) for the difference of two mappings vector-valued in a finite or infinite-dimensional preordered space. Closely related to the well-known optimality criterion of scalar DC optimization, a mixed vectorial...

The inverse max + sum spanning tree (IMSST) problem is studied, which is the first inverse problem on optimization problems with combined minmax–minsum objective functions. Given an edge-weighted undirected network <InlineEquation ID="IEq3"> <EquationSource Format="TEX">$$G(V,E,c,w)$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mrow> <mi>G</mi> <mo stretchy="false">(</mo> <mi>V</mi> <mo>,</mo> <mi>E</mi> <mo>,</mo> <mi>c</mi> <mo>,</mo> <mi>w</mi> <mo stretchy="false">)</mo> </mrow> </math> </EquationSource> </InlineEquation>, the MSST problem is to find a...</equationsource></equationsource></inlineequation>

Detecting and solving aircraft conflicts, which occur when aircraft sharing the same airspace are too close to each other according to their predicted trajectories, is a crucial problem in Air Traffic Management. We focus on mixed-integer optimization models based on speed regulation. We first...

A modified projection method for strongly pseudomonotone variational inequalities is considered. Strong convergence and error estimates for the sequences generated by this method are studied in two versions of the method: the stepsizes are chosen arbitrarily from a given fixed closed interval...

In this paper, a notion of Levitin–Polyak (LP in short) well-posedness is introduced for a vector optimization problem in terms of minimizing sequences and efficient solutions. Sufficient conditions for the LP well-posedness are studied under the assumptions of compactness of the feasible set,...

In this paper, we employ the image space analysis (for short, ISA) to investigate vector quasi-equilibrium problems (for short, VQEPs) with a variable ordering relation, the constrained condition of which also consists of a variable ordering relation. The quasi relatively weak VQEP (for short,...

Recently the thermostatted kinetic framework has been proposed as mathematical model for studying nonequilibrium complex systems constrained to keep constant the total energy. The time evolution of the distribution function of the system is described by a nonlinear partial integro-differential...

We review algorithms developed for nonnegative matrix factorization (NMF) and nonnegative tensor factorization (NTF) from a unified view based on the block coordinate descent (BCD) framework. NMF and NTF are low-rank approximation methods for matrices and tensors in which the low-rank factors...