Searcharxiv⌕ Search

arXiv subjects

Anurag Jayswal

Publications and source records attributed to Anurag Jayswal.

3 recordsLinked to original sources

Proximal point algorithm for interval valued optimization problems with application to lasso problem

In this paper, we consider a class of unconstrained interval valued optimization problems and using a suitable scalarization technique, we formulate an associated scalarized optimization problem and establish the relationships between the optimal solution of the scalarized problem and the $LU$-nondominated solution of the considered optimization problem. Based on this framework, we propose a proximal point algorithm and derive the global convergence of the sequence generated by the proposed algorithm along with the sublinear and linear rate of convergence for convex and strongly convex cases, respectively. Finally, we provide suitable numerical experiments along with comparative analysis with an existing method and applicability of the proposed algorithm on an interval valued lasso regression problem, highlighting its potential in machine learning models with uncertain data.

math.OC↗

Proximal gradient method for multiobjective interval valued optimization problem with application in portfolio selection

In this article, we consider a class of unconstrained multiobjective interval-valued optimization problems in which each objective function is a sum of a generalized Hukuhara(gH)-differentiable interval valued function and a proper, convex and gH-lower semicontinuous interval valued function, which is possibly non-gH-differentiable. Within this framework, we introduce the notion of a proximal gradient direction and characterize the Pareto critical points of the considered problem through a strongly convex auxiliary subproblem. Based on these characterizations, we develop a proximal gradient algorithm with an Armijo-type line search that ensures sufficient descent with respect to the interval partial order. We then establish the existence of an uniform lower bound on the admissible step length, the global convergence of the generated sequence to a Pareto critical point followed by a global rate of convergence in the general nonconvex setting. The theoretical findings of the proposed method are validated through some test problems and further illustrate its applicability on portfolio selection problems involving interval-valued data.

math.OC↗

Neural network model for mathematical programming problems with complementary constraints

In this paper, we propose a a gradient-based neural network model to solve the mathematical programming problems with complementary constraints (MPCC). In order to facilitate tractable optimization, the problem MPCC is transformed via a regularized approach into a relaxed nonlinear optimization problem NLP($β$). After that employing the penalty function and neural network model an estimate of the optimal solution of the problem NLP($β$) is obtained. On the basis of Lyapunov stability theory and LaSalle invariance principle, the equilibrium point of proposed neural network is theoretically proven to be asymptotically stable and capable to generate optimal solution of the problem MPCC. Further, we demonstrate the performance and dynamic behavior of the proposed neural network through various illustrative examples and its effectiveness via theoretical and numerical experiments.

math.OC↗