47 citations · 276 across the 21 of their papers we have counts for
21 papers
A polynomial time infeasible interior-point arc-search algorithm for convex optimization
Yaguang Yang
This paper proposes an infeasible interior-point algorithm for the convex optimization problem using arc-search techniques. The proposed algorithm simultaneously selects the center…
On the facet pivot simplex method for linear programming II: a linear iteration bound
Yaguang Yang
The Hirsch Conjecture stated that any -dimensional polytope with n facets has a diameter at most equal to . This conjecture was disproved by Santos (A counterexample to t…
A double-pivot degenerate-robust simplex algorithm for linear programming
Yaguang Yang, Fabio Vitor
A double pivot algorithm that combines features of two recently published papers by these authors is proposed. The proposed algorithm is implemented in MATLAB. The MATLAB code is t…
Cycling problems in linear programming
Yaguang Yang
This paper provides a set of cycling problems in linear programming. These problems should be useful for researchers to develop and test new simplex algorithms. As matter of the fa…
A double-pivot simplex algorithm and its upper bounds of the iteration numbers
Yaguang Yang
In this paper, a double-pivot simplex method is proposed. Two upper bounds of iteration numbers are derived. Applying one of the bounds to some special linear programming (LP) prob…
A Facet Enumeration Algorithm for Convex Polytopes
Yaguang Yang
This paper proposes a novel and simple algorithm of facet enumeration for convex polytopes. The complexity of the algorithm is discussed. The algorithm is implemented in Matlab. So…
An Infeasible Interior-point Arc-search Algorithm for Nonlinear Constrained Optimization
Einosuke Iida, Yaguang Yang, Makoto Yamashita
In this paper, we propose an infeasible arc-search interior-point algorithm for solving nonlinear programming problems. Most algorithms based on interior-point methods are categori…
A note on the diameter of convex polytope
Yaguang Yang
This short note extends a recent result (Bonifas et al, On sub-determinants and the diameter of polyhedra, Discrete Computational Geometry, 52, 2014) of an upper bound of the diame…
Model Predictive Control in Spacecraft Rendezvous and Soft Docking
Yaguang Yang
This paper discusses translation and attitude control in spacecraft rendezvous and soft docking. The target spacecraft orbit can be either circular or elliptic. The high fidelity m…
An Efficient LQR Design for Discrete-Time Linear Periodic System Based on a Novel Lifting Method
Yaguang Yang
This paper proposes a novel lifting method which converts the standard discrete-time linear periodic system to an augmented linear time-invariant system. The linear quadratic optim…
Singularity-Free Spacecraft Attitude Control Using Variable-Speed Control Moment Gyroscopes
Yaguang Yang
This paper discusses spacecraft control using variable-speed CMGs. A new operational concept for VSCMGs is proposed. This new concept makes it possible to approximate the complex n…
Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
Yaguang Yang
Since the beginning of the development of interior-point methods, there exists a puzzling gap between the results in theory and the observations in numerical experience, i.e., algo…
Spacecraft Attitude and Reaction Wheel Desaturation Combined Control Method
Yaguang Yang
Two popular types of spacecraft actuators are reaction wheels and magnetic torque coils. Magnetic torque coils are particularly interesting because they can be used for both attitu…
An Efficient Algorithm for Periodic Riccati Equation for Spacecraft Attitude Control Using Magnetic Torques
Yaguang Yang
Spacecraft attitude control using only magnetic torques is a periodic time-varying system as the Earth magnetic field in the spacecraft body frame changes periodically while the sp…
Controllability of Spacecraft Using Only Magnetic Torques
Yaguang Yang
Spacecraft attitude control using only magnetic torques is a time-varying system. Many designs were proposed using LQR and H-infinity formulations. The existence of the solutions d…
Arc-Search Infeasible Interior-Point Algorithm for Linear Programming
Yaguang Yang
Mehrotra's algorithm has been the most successful infeasible interior-point algorithm for linear programming since 1990. Most popular interior-point software packages for linear pr…
An Analytic Solution to Wahba's Problem
Yaguang Yang, Zhiqiang Zhou
All spacecraft attitude estimation methods are based on Wahba's optimization problem. This problem can be reduced to finding the largest eigenvalue and the corresponding eigenvecto…
An Efficient Polynomial Interior-Point Algorithm for Linear Programming
Yaguang Yang
For interior-point algorithms in linear programming, it is well-known that the selection of the centering parameter is crucial for proving polynomility in theory and for efficiency…
Constrained LQR Design Using Interior-Point Arc-Search Method for Convex Quadratic Programming with Box Constraints
Yaguang Yang
Although the classical LQR design method has been very successful in real world engineering designs, in some cases, the classical design method needs modifications because of the s…
A Globally and Quadratically Convergent Algorithm with Efficient Implementation for Unconstrained Optimization
Yaguang Yang
In this paper, an efficient modified Newton type algorithm is proposed for nonlinear unconstrianed optimization problems. The modified Hessian is a convex combination of the identi…
A robust BFGS algorithm for unconstrained nonlinear optimization problems
Yaguang Yang
In this paper, a modified BFGS algorithm is proposed. The modified BFGS matrix estimates a modified Hessian matrix which is a convex combination of an identity matrix for the steep…