Related papers: Multiobjective Programming and Weighting Scalar Pr…
This paper begins with a class of convex quadratic programs (QPs) with bounded variables solvable by the parametric principal pivoting algorithm with $\mathcal{O}(n^3)$ strongly polynomial complexity, where $n$ is the number of variables of…
We analyze a pointwise tracking multiobjective optimal control problem subject to the Poisson problem and bilateral control constraints. To approximate Pareto optimal points and the Pareto front numerically, we consider two different finite…
This paper works with preconvexlike set-valued vector optimization problems in topological linear spaces. A Fakas-Minkowski alternative theorem, a scalarization theorem, some vector saddle-point theorems and some scalar saddle point theorem…
In this manuscript, we analyze the expansions of functions in orthogonal polynomials associated with a general weight function in a multidimensional setting. Such orthogonal polynomials can be obtained by Gram-Schmidt orthogonalization.…
In Noor (2007)[Muhammad Aslam Noor, New iterative schemes for nonlinear equations, Appl. Math. Comput. 187 (2007) 937-943], proposed an algorithm namely \textbf{Algorithm 2.4} and established a proof to show cubic convergence. The presented…
Many engineering problems have multiple objectives, and the overall aim is to optimize a non-linear function of these objectives. In this paper, we formulate the problem of maximizing a non-linear concave function of multiple long-term…
We give a short proof of an inequality, conjectured by Tsfasman and proved by Serre, for the maximum number of points on hypersurfaces over finite fields. Further, we consider a conjectural extension, due to Tsfasman and Boguslavsky, of…
We study certain linear algebra algorithms for recursive block matrices. This representation has useful practical and theoretical properties. We summarize some previous results for block matrix inversion and present some results on…
Geometric duality theory for multiple objective linear programming problems turned out to be very useful for the development of efficient algorithms to generate or approximate the whole set of nondominated points in the outcome space. This…
In representation learning (RL), how to make the learned representations easy to interpret and less overfitted to training data are two important but challenging issues. To address these problems, we study a new type of regulariza- tion…
This paper is concerned with solving nonconvex learning problems with folded concave penalty. Despite that their global solutions entail desirable statistical properties, they lack optimization techniques that guarantee global optimality in…
Based on the correspondence of projection to an eigenvalue problem via the underlying group structure, we generalize the projection algorithm proposed by Morrison et al. This algorithm is eligible for large-scale computations, because we…
A generalization with singular weights of Moore-Penrose generalized inverses of closed range operators in Hilbert spaces is studied using the notion of compatibility of subspaces and positive operators.
In this note we point out various errors in the paper by Rashmi Gupta and R. R. Saxena, Set packing problem with linear fractional objective function, International Journal of Mathematics and Computer Applications Research (IJMCAR), 4…
This paper is aimed to prove the strong duality theorem for continuous-time linear programming problems in which the coefficients are assumed to be piecewise continuous functions. The previous paper proved the strong duality theorem for the…
Overparameterized models may have many interpolating solutions; implicit regularization refers to the hidden preference of a particular optimization method towards a certain interpolating solution among the many. A by now established line…
The maximum graph bisection problem is a well known graph partition problem. The problem has been proven to be NP-hard. In the maximum graph bisection problem it is required that the set of vertices is divided into two partition with equal…
We prove an Assmus-Mattson-type theorem for block codes where the alphabet is the vertex set of a commutative association scheme (say, with $s$ classes). This in particular generalizes the Assmus-Mattson-type theorems for…
We consider the problem of the computation of $\inf_p \theta p$ over the set of exponent pairs $P \ni p$ under linear constraints for a certain class of objective functions $\theta$. An effective algorithm is presented. The output of the…
Over an algebraically closed field, the $\textit{double point interpolation}$ problem asks for the vector space dimension of the projective hypersurfaces of degree $d$ singular at a given set of points. After being open for 90 years, a…