activity
20152026
most citedAn Infeasible-Interior-Point Algorithm for Linear Programming

15 citations · 18 across the 10 of their papers we have counts for

collaborators
Showing 2026Show all

5 papers · 1 filter

math.OC2026

ArcLP: A Matlab implementation of an arc-search infeasible interior-point algorithm for linear programming

Yang, Yaguang

This paper presents a Matlab implementation of an arc-search infeasible interior point algorithm for linear programming (LP), which has a proven polynomial bound of $\mathcal{O}(\s…

math.OC2026

Combining Reinforcement Learning with Arc-search Interior-Point Method for Path Planning

Yaguang Yang, Qiang Le, Isaac E. Weintraub

Path planning in environments containing obstacles has numerous practical applications. The problem is challenging because it is inherently nonlinear and nonconvex. Consequently, a…

cs.RO2026

Path Planning Using Deep Deterministic Policy Gradient: A Reinforcement Learning Approach

Qiang Le, Yaguang Yang, Isaac E. Weintraub

Path-planning for autonomous vehicles in threat-laden environments is a fundamental challenge because the problem is nonlinear and nonconvex even in simplest scenarios. While tradi…

math.OC2026

An arc-search BFGS algorithm for unconstrained nonlinear optimization problems

Yaguang Yang

The classical BFGS algorithm performs excellently for convex optimization problems. However, for non-convex problems, the classical BFGS method may fail to converge reliably. To ov…

math.OC2026

A Comparison of Reinforcement Learning and Optimal Control Methods for Path Planning

Qiang Le, Yaguang Yang, Isaac E. Weintraub

Path-planning for autonomous vehicles in threat-laden environments is a fundamental challenge. While traditional optimal control methods can find ideal paths, the computational tim…