Related papers: Multiobjective Programming and Weighting Scalar Pr…
In this work, we establish some coincidence point results for self-mappings satisfying rational type contractions in generalized metric spaces in the sense of Branciari [7]. Presented coincidence point theorems weak and extend numerous…
It has been pointed out to the author by David Glickenstein that the proof of the (closely related) Lemmas 1.2 and 3.2 in the title paper is incorrect. The statements of both Lemmas are correct, and the purpose of this note is to give a…
For strongly convex objectives that are smooth, the classical theory of gradient descent ensures linear convergence relative to the number of gradient evaluations. An analogous nonsmooth theory is challenging. Even when the objective is…
We consider N-fold 4-block decomposable integer programs, which simultaneously generalize N-fold integer programs and two-stage stochastic integer programs with N scenarios. In previous work [R. Hemmecke, M. Koeppe, R. Weismantel, A…
Verifying properties of object-oriented software requires a method for handling references in a simple and intuitive way, closely related to how O-O programmers reason about their programs. The method presented here, a Calculus of Object…
A multiobjective optimization problem is $C^r$ simplicial if the Pareto set and the Pareto front are $C^r$ diffeomorphic to a simplex and, under the $C^r$ diffeomorphisms, each face of the simplex corresponds to the Pareto set and the…
This is an erratum to the article: "Computation of maximal projection constants" (J. Funct. Anal., 277). The statement of Lemma 3.1(2) of that paper is incorrect. As a consequence of this the proof of Theorem 1.4 is incomplete. In this…
This paper introduces a novel double regularization scheme for bilevel optimization problems whose lower-level problem is composite and convex, but not necessarily strongly convex, in the lower-level variable. The analysis focuses on the…
In this paper we analyze theoretical properties of bi-objective convex-quadratic problems. We give a complete description of their Pareto set and prove the convexity of their Pareto front. We show that the Pareto set is a line segment when…
In this short note we prove by a counter-example that Theorem 3.2 in the paper "A study on concave optimization via canonical dual function" by J. Zhu, S. Tao, D. Gao is false; moreover, we give a very short proof for Theorem 3.1 in the…
Multi-objective integer or mixed-integer programming problems typically have disconnected feasible domains, making the task of constructing an approximation of the Pareto front challenging. The present paper shows that certain algorithms…
We propose a computationally efficient estimator, formulated as a convex program, for a broad class of non-linear regression problems that involve difference of convex (DC) non-linearities. The proposed method can be viewed as a significant…
The non-convex quadratic orogramming problem and the non-monotone linear complementarity problem are NP-complete problems. In this paper we first show taht the inverse problem of determinning a KKT point of the non-convex quadratic…
Some properties of generalized convexity for sets and for functions are identified in case of the reliability polynomials of two dual minimal networks. A method of approximating the reliability polynomials of two dual minimal network is…
The convergence of the algorithm for solving convex feasibility problem is studied by the method of sequential averaged and relaxed projections. Some results of H. H. Bauschke and J. M. Borwein are generalized by introducing new methods.…
Computer Algebra systems are widely spread because of some of their remarkable features such as their ease of use and performance. Nonetheless, this focus on performance sometimes leads to unwanted consequences: algorithms and computations…
This paper deals with discrete topology optimization and describes the modification of a single-objective algorithm into its multi-objective counterpart. The result is a significant increase in the optimization speed and quality of the…
One of the most remarkable theorems in coding theory is Gleason's 1970 theorem about the weight enumerators of self-dual codes. In the past 36 years there have been hundreds of papers written about generalizations and applications of this…
An explicit formula for a weight enumerator of linear-congruence codes is provided. This extends the work of Bibak and Milenkovic [IEEE ISIT (2018) 431-435] addressing the binary case to the non-binary case. Furthermore, the extension…
In a multiple linear regression model, the algebraic formula of the decomposition theorem explains the relationship between the univariate regression coefficient and partial regression coefficient using geometry. It was found that…