Semi-infinite Optimization Problem Research Articles

E-optimality and E-duality results for fractional semi-infinite optimization problems having equilibrium constraints

E-optimality and E-duality results for fractional semi-infinite optimization problems having equilibrium constraints

Optimality conditions and duality for multiobjective semi-infinite optimization problems with switching constraints on Hadamard manifolds

Optimality conditions and duality for multiobjective semi-infinite optimization problems with switching constraints on Hadamard manifolds

On the convergence of local solutions for the method quADAPT

ABSTRACT A classical solution approach to semi-infinite programming, which is easy to implement, is based on discretizing the semi-infinite index set. The Blankenship and Falk algorithm adaptively chooses a small discretization. On every iteration, a solution based on the current discretization is calculated. In a second step, the most violated constraint is determined and added to the discretization. In a previous work, the authors showed that the algorithm has a slow convergence and introduced a new method that exhibits a quadratic rate [Seidel and Küfer, An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence. Optimization. 2022;71(8):2211–2239]. In this paper, we further investigate the introduced method. The method implements new constraints that can cut off parts of the feasible set. We will study the effect on local minima. We assume that in each iteration local solutions to the discretized problems are computed. We will give an example showing that in general a limit point is not necessarily a local solution of the original semi-infinite problem, but only of an approximate problem. We then study second-order conditions and show that they coincide for both problems. We use this to develop conditions under which local solutions converge to a local solution in the limit. Finally, we present quadratic convergence results for the case of local solutions.

A note on duality in nonsmooth minimax fractional optimization problems with an infinite number of constraints

In this paper, we introduce duality for nonsmooth minimax fractional semi-infinite optimization problems in Asplund space by using some advanced tools of variational analysis and generalized differentiation. We propose a dual problem to the primal one; then weak, strong and converse-like duality relations are explored. In addition, some of these results are applied to multiobjective optimization problems.

On Semi-Infinite Optimization Problems with Vanishing Constraints Involving Interval-Valued Functions

In this paper, we examine a semi-infinite interval-valued optimization problem with vanishing constraints (SIVOPVC) that lacks differentiability and involves constraints that tend to vanish. We give definitions of generalized convex functions along with supportive examples. We investigate duality theorems for the SIVOPVC problem. We establish these theorems by creating duality models, which establish a relationship between SIVOPVC and its corresponding dual models, assuming generalized convexity conditions. Some examples are also given to illustrate the results.

Optimality and duality analysis for multiobjective interval-valued semi-infinite optimization problem having vanishing constraints

Optimality and duality analysis for multiobjective interval-valued semi-infinite optimization problem having vanishing constraints

Two-channel optimal energy-efficient control of distributed parameter systems

A formulation and method for solving the problem of the energy-efficient two-channel programmed control of an object with distributed parameters with a given-precision uniform approximation of the resulting spatial distribution of the controlled quantity to the required state is proposed. Two internal controls on the power of heat sources in the electromagnetic field of the inductor are considered as control actions. Proposed solution approach involves a special-form preliminary parametrization procedure for control actions on finite-dimensional subsets of the terminal values of conjugate variables in the boundary-value problem of Pontryagin’s maximum principle, in combination with the subsequent reduction to a semi-infinite optimization problem, which is solved with respect to the requisite parameter vector using the alternance method based on additional information about fundamental laws of the subject area. An example of optimal energy-efficient control of transient heat conduction, which is of independent interest, is given.

Approximate optimality conditions and duality results for non-smooth semi-infinite programming problems

This paper concentrates on investigating a semi-infinite optimization problem with cone constraints. Under the attainment of Abadie constraint qualification, an approximate necessary optimality condition by employing Clarke subdifferential for the semi-infinite optimization problem having cone constraints is developed. A new class of functions namely Q-quasiconvex functions is introduced and in the light of the approximate pseudoconvexity and Q-quasiconvexity assumptions, an approximate sufficient optimality condition is investigated using locally Lipschitz functions. Additionally, we formulate the approximate Wolfe's and approximate Mond-Weir dual problems for the non-smooth semi-infinite optimization problem. Subsequently, duality relations in terms of weak, strong and converse results between the semi-infinite optimization model and the aforementioned dual problems are established under the approximate pseudoconvexity and Q-quasiconvexity assumptions. Moreover, to justify the main results of the paper, numerical examples have been shown at suitable places.

Optimality Conditions of the Approximate Efficiency for Nonsmooth Robust Multiobjective Fractional Semi-Infinite Optimization Problems

This paper is devoted to the investigation of optimality conditions and saddle point theorems for robust approximate quasi-weak efficient solutions for a nonsmooth uncertain multiobjective fractional semi-infinite optimization problem (NUMFP). Firstly, a necessary optimality condition is established by using the properties of the Gerstewitz’s function. Furthermore, a kind of approximate pseudo/quasi-convex function is defined for the problem (NUMFP), and under its assumption, a sufficient optimality condition is obtained. Finally, we introduce the notion of a robust approximate quasi-weak saddle point to the problem (NUMFP) and prove corresponding saddle point theorems.

Computing T-optimal designs via nested semi-infinite programming and twofold adaptive discretization

Modelling real processes often results in several suitable models. In order to be able to distinguish, or discriminate, which model best represents a phenomenon, one is interested, e.g., in so-called T-optimal designs. These consist of the (design) points from a generally continuous design space at which the models deviate most from each other under the condition that they are best fitted to those points. Thus, the T-criterion represents a bi-level optimization problem, which can be transferred into a semi-infinite one but whose solution is very unstable or time consuming for non-linear models and non-convex lower- and upper-level problems. If one considers only a finite number of possible design points, a numerically well tractable linear semi-infinite optimization problem arises. Since this is only an approximation of the original model discrimination problem, we propose an algorithm which alternately and adaptively refines discretizations of the parameter as well as of the design space and, thus, solves a sequence of linear semi-infinite programs. We prove convergence of our method and its subroutine and show on the basis of discrimination tasks from process engineering that our approach is stable and can outperform the known methods.

Automatic Scenario Generation for Robust Optimal Control Problems*

Existing methods for nonlinear robust control often use scenario-based approaches to formulate the control problem as nonlinear optimization problems. Increasing the number of scenarios improves robustness, while increasing the size of the optimization problems. Mitigating the size of the problem by reducing the number of scenarios requires knowledge about how the uncertainty affects the system. This paper draws from local reduction methods used in semi-infinite optimization to solve robust optimal control problems with parametric uncertainty. We show that nonlinear robust optimal control problems are equivalent to semi-infinite optimization problems and can be solved by local reduction. By iteratively adding interim globally worst-case scenarios to the problem, methods based on local reduction provide a way to manage the total number of scenarios. In particular, we show that local reduction methods find worst case scenarios that are not on the boundary of the uncertainty set. The proposed approach is illustrated with a case study with both parametric and additive time-varying uncertainty. The number of scenarios obtained from local reduction is 101, smaller than in the case when all 214+3x192 boundary scenarios are considered. A validation with randomly drawn scenarios shows that our proposed approach reduces the number of scenarios and ensures robustness even if local solvers are used.

A Cutting-Plane Method for Sublabel-Accurate Relaxation of Problems with Product Label Spaces

Many problems in imaging and low-level vision can be formulated as nonconvex variational problems. A promising class of approaches to tackle such problems are convex relaxation methods, which consider a lifting of the energy functional to a higher-dimensional space. However, they come with increased memory requirements due to the lifting. The present paper is an extended version of the earlier conference paper by Ye et al. (in: DAGM German conference on pattern recognition (GCPR), 2021) which combined two recent approaches to make lifting more scalable: product-space relaxation and sublabel-accurate discretization. Furthermore, it is shown that a simple cutting-plane method can be used to solve the resulting semi-infinite optimization problem. This journal version extends the previous conference work with additional experiments, a more detailed outline of the complete algorithm and a user-friendly introduction to functional lifting methods.

Duality results for interval-valued semiinfinite optimization problems with equilibrium constraints using convexificators

This paper deals with the study of interval-valued semiinfinite optimization problems with equilibrium constraints (ISOPEC) using convexificators. First, we formulate Wolfe-type dual problem for (ISOPEC) and establish duality results between the (ISOPEC) and the corresponding Wolfe-type dual under the assumption of partial ^{*} -convexity. Second, we formulate Mond–Weir-type dual problem and propose duality results between the (ISOPEC) and the corresponding Mond–Weir-type dual under the assumption of partial ^{*} -convexity, partial ^{*} -pseudoconvexity, and partial ^{*} -quasiconvexity.

Model-Free Bounds for Multi-Asset Options Using Option-Implied Information and Their Exact Computation

We consider derivatives written on multiple underlyings in a one-period financial market, and we are interested in the computation of model-free upper and lower bounds for their arbitrage-free prices. We work in a completely realistic setting, in that we only assume the knowledge of traded prices for other single- and multi-asset derivatives and even allow for the presence of bid–ask spread in these prices. We provide a fundamental theorem of asset pricing for this market model, as well as a superhedging duality result, that allows to transform the abstract maximization problem over probability measures into a more tractable minimization problem over vectors, subject to certain constraints. Then, we recast this problem into a linear semi-infinite optimization problem and provide two algorithms for its solution. These algorithms provide upper and lower bounds for the prices that are ε-optimal, as well as a characterization of the optimal pricing measures. These algorithms are efficient and allow the computation of bounds in high-dimensional scenarios (e.g., when d = 60). Moreover, these algorithms can be used to detect arbitrage opportunities and identify the corresponding arbitrage strategies. Numerical experiments using both synthetic and real market data showcase the efficiency of these algorithms, and they also allow understanding of the reduction of model risk by including additional information in the form of known derivative prices. This paper was accepted by Chung Piaw Teo, optimization. Funding: This work was supported by the Nanyang Technological University [NAP Grant] and the Hellenic Foundation for Research and Innovation [Grant HFRI-FM17-2152]. Supplemental Material: The data files and online appendices are available at https://doi.org/10.1287/mnsc.2022.4456 .

Stability Analysis for Semi-Infinite Vector Optimization Problems under Functional Perturbations

This paper aims to study the stability of a class of semi-infinite vector optimization problems (SVOP) under functional perturbations. By using an important hypothesis a necessary and sufficient condition of Hausdorff continuity for weak efficient solution mappings and certain sufficient conditions for Painlevé-Kuratowski convergence of weak efficient solution sets for SVOP are established under the perturbations of both constraint sets and objective functions.

Solving continuous set covering problems by means of semi-infinite optimization

This article introduces the new class of continuous set covering problems. These optimization problems result, among others, from product portfolio design tasks with products depending continuously on design parameters and the requirement that the product portfolio satisfies customer specifications that are provided as a compact set. We show that the problem can be formulated as semi-infinite optimization problem (SIP). Yet, the inherent non-smoothness of the semi-infinite constraint function hinders the straightforward application of standard methods from semi-infinite programming. We suggest an algorithm combining adaptive discretization of the infinite index set and replacement of the non-smooth constraint function by a two-parametric smoothing function. Under few requirements, the algorithm converges and the distance of a current iterate can be bounded in terms of the discretization and smoothing error. By means of a numerical example from product portfolio optimization, we demonstrate that the proposed algorithm only needs relatively few discretization points and thus keeps the problem dimensions small.

Characterizations of Approximate Optimality Conditions for Fractional Semi-Infinite Optimization Problems With Uncertainty

This paper is devoted to the investigation of a class of multi-objective fractional semi-infinite optimization problems with uncertain data. Firstly, a robust counterpart for the uncertain multi-objective optimization problem is introduced in terms of robust optimization method. And following the idea due to Dinkelbach, we associate the robust counterpart with a multi-objective optimization problem. Then, by using a scalarization method, its corresponding scalarization optimization problem is established. The relationship between robust solutions of the multi-objective optimization problem and that of its corresponding scalarization optimization problem is described. Finally, by using a robust type sub-differential constraint qualification, the robust optimality condition for approximate quasi-efficient solutions of the multi-objective fractional optimization problem is established.

Compensating Data Shortages in Manufacturing with Monotonicity Knowledge

Systematic decision making in engineering requires appropriate models. In this article, we introduce a regression method for enhancing the predictive power of a model by exploiting expert knowledge in the form of shape constraints, or more specifically, monotonicity constraints. Incorporating such information is particularly useful when the available datasets are small or do not cover the entire input space, as is often the case in manufacturing applications. We set up the regression subject to the considered monotonicity constraints as a semi-infinite optimization problem, and propose an adaptive solution algorithm. The method is applicable in multiple dimensions and can be extended to more general shape constraints. It was tested and validated on two real-world manufacturing processes, namely, laser glass bending and press hardening of sheet metal. It was found that the resulting models both complied well with the expert’s monotonicity knowledge and predicted the training data accurately. The suggested approach led to lower root-mean-squared errors than comparative methods from the literature for the sparse datasets considered in this work.

On Minimax Fractional Semi-Infinite Programming Problems with Applications

Using some advanced tools of variational analysis and generalized differentiation, we establish necessary conditions for locally optimal solutions of minimax fractional programming problems under the limiting constraint qualification (LCQ). Sufficient conditions for such solutions to the considered problem are also provided by introducing generalized convex functions defined in terms of the limiting subdifferential for locally Lipschitz functions. In addition, some duality results for minimax fractional programming problems are also provided. Finally, by using the obtained results, we derive necessary and sufficient conditions for weak Pareto solutions to the multiobjective semi-infinite fractional optimization problem.

On Exchange Methods for Nonlinear Semi-Infinite Programs

A new exchange method is presented for semi-infinite optimization problems with polyhedron constraints. The basic idea is to use an active set strategy as exchange rule to construct an approximate problem with finitely many constraints at each iteration. Under mild conditions, we prove that the proposed algorithm terminates in a finite number of iterations and guarantees that the solution of the resulting approximate problem at final iteration converges to the solution of the original problem within arbitrarily given tolerance. Numerical results indicate that the proposed algorithm is efficient and promising.