Harshal D. Kaushik
YOU?
Author Swipe
View article: Hybrid Powertrain Optimization for Regional Aircraft Integrating Hydrogen Fuel Cells and Aluminum Air Batteries
Hybrid Powertrain Optimization for Regional Aircraft Integrating Hydrogen Fuel Cells and Aluminum Air Batteries Open
With the increasing demand for air travel and the urgency to reduce emissions, transitioning from fossil fuel-based propulsion systems is a critical step toward sustainable aviation. While batteries are widely used in urban air mobility, t…
View article: On Solution Functions of Optimization: Universal Approximation and Covering Number Bounds
On Solution Functions of Optimization: Universal Approximation and Covering Number Bounds Open
We study the expressibility and learnability of solution functions of convex optimization and their multi-layer architectural extension. The main results are: (1) the class of solution functions of linear programming (LP) and quadratic pro…
View article: Decision-Focused Learning for Inverse Noncooperative Games: Generalization Bounds and Convergence Analysis
Decision-Focused Learning for Inverse Noncooperative Games: Generalization Bounds and Convergence Analysis Open
Finding the equilibrium strategy of agents is one of the central problems in game theory. Perhaps equally intriguing is the inverse of the above problem: from the available finite set of actions at equilibrium, how can we learn the utiliti…
View article: On Solution Functions of Optimization: Universal Approximation and Covering Number Bounds
On Solution Functions of Optimization: Universal Approximation and Covering Number Bounds Open
We study the expressibility and learnability of convex optimization solution functions and their multi-layer architectural extension. The main results are: \emph{(1)} the class of solution functions of linear programming (LP) and quadratic…
View article: Iterative Implicit Gradients for Nonconvex Optimization with Variational Inequality Constraints
Iterative Implicit Gradients for Nonconvex Optimization with Variational Inequality Constraints Open
We propose an optimization proxy in terms of iterative implicit gradient methods for solving constrained optimization problems with nonconvex loss functions. This framework can be applied to a broad range of machine learning settings, incl…
View article: Distributed Randomized Block Stochastic Gradient Tracking Method
Distributed Randomized Block Stochastic Gradient Tracking Method Open
We consider distributed optimization over networks where each agent is associated with a smooth and strongly convex local objective function. We assume that the agents only have access to unbiased estimators of the gradient of their object…
View article: An Incremental Gradient Method for Optimization Problems with Variational Inequality Constraints
An Incremental Gradient Method for Optimization Problems with Variational Inequality Constraints Open
We consider minimizing a sum of agent-specific nondifferentiable merely convex functions over the solution set of a variational inequality (VI) problem in that each agent is associated with a local monotone mapping. This problem finds an a…
View article: An Incremental Gradient Method for Large-scale Distributed Nonlinearly Constrained Optimization
An Incremental Gradient Method for Large-scale Distributed Nonlinearly Constrained Optimization Open
Motivated by applications arising from sensor networks and machine learning, we consider the problem of minimizing a finite sum of nondifferentiable convex functions where each component function is associated with an agent and a hard-to-p…
View article: A Method with Convergence Rates for Optimization Problems with Variational Inequality Constraints
A Method with Convergence Rates for Optimization Problems with Variational Inequality Constraints Open
We consider a class of optimization problems with Cartesian variational inequality (CVI) constraints, where the objective function is convex and the CVI is associated with a monotone mapping and a convex Cartesian product set. This mathema…
View article: A Method with Convergence Rates for Optimization Problems with\n Variational Inequality Constraints
A Method with Convergence Rates for Optimization Problems with\n Variational Inequality Constraints Open
We consider a class of optimization problems with Cartesian variational\ninequality (CVI) constraints, where the objective function is convex and the\nCVI is associated with a monotone mapping and a convex Cartesian product set.\nThis math…
View article: A Projection-free Incremental Gradient Method for Large-scale Constrained Optimization
A Projection-free Incremental Gradient Method for Large-scale Constrained Optimization Open
The problem of minimizing finite sums where each component function is associated with a block of dataset, is very popular in machine learning. Among well-known avenues to address this class of problems is the incremental gradient (IG) met…
View article: An Incremental Gradient Method for Large-scale Distributed Nonlinearly\n Constrained Optimization
An Incremental Gradient Method for Large-scale Distributed Nonlinearly\n Constrained Optimization Open
Motivated by applications arising from sensor networks and machine learning,\nwe consider the problem of minimizing a finite sum of nondifferentiable convex\nfunctions where each component function is associated with an agent and a\nhard-t…
View article: A log-third order polynomial normal transformation approach for high-reliability estimation with scarce samples
A log-third order polynomial normal transformation approach for high-reliability estimation with scarce samples Open
Normal transformations are often used in reliability analysis. A Third order Polynomial Normal Transformation (TPNT) approach is used in this work. The underlying idea is to approximate the Cumulative Distribution Function (CDF) of the res…
View article: A Randomized Block Coordinate Iterative Regularized Gradient Method for High-dimensional Ill-posed Convex Optimization
A Randomized Block Coordinate Iterative Regularized Gradient Method for High-dimensional Ill-posed Convex Optimization Open
Motivated by high-dimensional nonlinear optimization problems as well as ill-posed optimization problems arising in image processing, we consider a bilevel optimization model where we seek among the optimal solutions of the inner level pro…
View article: Utilization of Wind Shear for Powering Unmanned Aerial Vehicles in Surveillance Application: A Numerical Optimization Study
Utilization of Wind Shear for Powering Unmanned Aerial Vehicles in Surveillance Application: A Numerical Optimization Study Open
Dynamic soaring is the rationale behind the prolonged flights of a seabird Albatross. It involves utilization of energy from the wind shear present near the earth surface. Small unmanned aerial vehicles (UAVs) can be kept loitering without…