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

10 papers

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…

gr-qc2025

On optimal LISA orbit design

Yaguang Yang

The ESA/NASA joint LISA (laser interferometer space antenna) mission is designed to detect gravitational waves, which relies crucially on maintaining three-spacecraft constellation…

math.OC2024

A computationally efficient arc-search interior-point algorithm for nonlinear constrained optimization

Yaguang Yang

This paper proposes an arc-search interior-point algorithm for the nonlinear constrained optimization problem. The proposed algorithm uses the second-order derivatives to construct…

math.OC2024★ 3 cited

A Systematic Methodology for Modeling and Attitude Control of Multi-body Space Telescopes

Yaguang Yang, William Bentz, Lia Lewis

This paper derives a symbolic multi-body rigid nonlinear model for a space telescope using Stoneking's implementation of Kane's method. This symbolic nonlinear model is linearized…

math.OC2021

On the facet pivot simplex method for linear programming

Yaguang Yang

Dantzig's vertex pivot simplex method has been published for more than seven decades. Amazingly, it remains one of the most efficient methods to solve linear programming (LP) probl…

math.OC2015★ 15 cited

An Infeasible-Interior-Point Algorithm for Linear Programming

Yaguang Yang, Makoto Yamashita

In this paper, we propose an arc-search infeasible-interior-point algorithm. We show that this algorithm is polynomial and the polynomial bound is which is at least…