A5040651000- Stochastic Gradient Optimization Techniques
- Advanced Algorithms and Applications
- Advanced Optimization Algorithms Research
- Sparse and Compressive Sensing Techniques
- Metaheuristic Optimization Algorithms Research
- Vehicle Routing Optimization Methods
- Advanced Multi-Objective Optimization Algorithms
Lehigh University
2023-2025
Jilin University
2005-2007
Jilin Province Science and Technology Department
2005
Abstract Stochastic sequential quadratic optimization (SQP) methods for solving continuous problems with nonlinear equality constraints have attracted attention recently, such as large-scale data-fitting subject to nonconvex constraints. However, a recently proposed subclass of that is built on the popular stochastic-gradient methodology from unconstrained setting, convergence guarantees been limited asymptotic expected value stationarity measure zero. This in contrast setting which...
A novel discrete particle swarm optimization (PSO) method is presented to solve the generalized traveling salesman problem (GTSP). The "generalized vertex" employed represent problem, by which GTSP and TSP can be handled in a uniform style. An uncertain searching strategy local techniques are also accelerate convergent speed. Numerical results show effectiveness of proposed method.
.An algorithm for solving nonconvex smooth optimization problems is proposed, analyzed, and tested. The an extension of the trust-region with contractions expansions (TRACE) [F. E. Curtis, D. P. Robinson, M. Samadi, Math. Program., 162 (2017), pp. 1–32]. In particular, allows to use inexact solutions arising subproblems, which important feature large-scale problems. Inexactness allowed in a manner such that optimal iteration complexity \({\cal O}(\epsilon^{-3/2})\) attaining \(\epsilon\)...