Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- correctionSeptember 2024
- research-articleAugust 2024
Robust approximation of chance constrained optimization with polynomial perturbation
Computational Optimization and Applications (COOP), Volume 89, Issue 3Pages 977–1003https://doi.org/10.1007/s10589-024-00602-7AbstractThis paper proposes a robust approximation method for solving chance constrained optimization (CCO) of polynomials. Assume the CCO is defined with an individual chance constraint that is affine in the decision variables. We construct a robust ...
- research-articleJuly 2023
Hausdorff distance between convex semialgebraic sets
Journal of Global Optimization (KLU-JOGO), Volume 88, Issue 2Pages 409–429https://doi.org/10.1007/s10898-023-01313-9AbstractIn this paper, we proposed an approach for computing the Hausdorff distance between convex semialgebraic sets. We exploit the KKT conditions to rewrite the Hausdorff distance as polynomial maximization problems under some assumptions, in which ...
- research-articleJanuary 2023
Distributionally Robust Optimization with Moment Ambiguity Sets
Journal of Scientific Computing (JSCI), Volume 94, Issue 1https://doi.org/10.1007/s10915-022-02063-8AbstractThis paper studies distributionally robust optimization (DRO) when the ambiguity set is given by moments for the distributions. The objective and constraints are given by polynomials in decision variables. We reformulate the DRO with equivalent ...
- research-articleAugust 2022
The Saddle Point Problem of Polynomials
Foundations of Computational Mathematics (FOCM), Volume 22, Issue 4Pages 1133–1169https://doi.org/10.1007/s10208-021-09526-8AbstractThis paper studies the saddle point problem of polynomials. We give an algorithm for computing saddle points. It is based on solving Lasserre’s hierarchy of semidefinite relaxations. Under some genericity assumptions on defining polynomials, we ...
- research-articleMay 2022
Local saddle points for unconstrained polynomial optimization
Computational Optimization and Applications (COOP), Volume 82, Issue 1Pages 89–106https://doi.org/10.1007/s10589-022-00361-3AbstractThis paper gives an algorithm for computing local saddle points for unconstrained polynomial optimization. It is based on optimality conditions and Lasserre’s hierarchy of semidefinite relaxations. It can determine the existence of local saddle ...
- research-articleOctober 2021
A rotation-free quadrature element formulation for free vibration analysis of thin sectorial plates with arbitrary boundary supports
Computers & Mathematics with Applications (CMAP), Volume 99, Issue CPages 84–98https://doi.org/10.1016/j.camwa.2021.08.008AbstractDue to corner stress singularities, free vibration analysis of thin sectorial plates with arbitrary boundary supports including a free vertex is a rather challenging problem. In this paper, a novel rotation-free quadrature element ...
- research-articleFebruary 2020
A Novel Ensemble Anomaly based Approach for Command and Control Channel Detection
ICCSP 2020: Proceedings of the 2020 4th International Conference on Cryptography, Security and PrivacyPages 74–78https://doi.org/10.1145/3377644.3377652The C&C Channel is an indispensable characteristic of botnet. Recognizing and blocking the C&C Channel is of great importance to eliminate the threats of botnet. To overcome the limitation of major behavior based methods, we propose a new ensemble ...
- research-articleJanuary 2020
A Method of Detecting the Abnormal Encrypted Traffic Based on Machine Learning and Behavior Characteristics
ICCNS '19: Proceedings of the 2019 9th International Conference on Communication and Network SecurityPages 47–50https://doi.org/10.1145/3371676.3371705Classification of network traffic using port-based or deep packet-based analysis is becoming increasingly difficult with many peer-to-peer(P2P) applications using dynamic port numbers, especially in massive data streams. In view of the problem that ...
- research-articleMay 2019
An efficient technique for simultaneous local and overall buckling analysis of stiffened panels
Advances in Engineering Software (ADES), Volume 131, Issue CPages 36–47https://doi.org/10.1016/j.advengsoft.2019.03.002Highlights- An efficient technique is presented for buckling analysis of stiffened panels.
- A weak form quadrature plate element with stiffeners is formulated.
- Stiffener can be located anywhere in the plate other than along a nodal line of the ...
The overall buckling and local buckling of stiffened panels are two possible failure modes and thus should be concerned by engineers in the preliminary design of lightweight structures. In this paper, an efficient technique is proposed to solve ...
- articleFebruary 2014
Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities
Journal of Global Optimization (KLU-JOGO), Volume 58, Issue 2Pages 261–284https://doi.org/10.1007/s10898-013-0047-0This paper considers the optimization problem of minimizing a rational function. We reformulate this problem as a polynomial optimization problem by the technique of homogenization. These two problems are shown to be equivalent under some generic ...
- articleNovember 2013
The steepest descent algorithm without line search for p-Laplacian
Applied Mathematics and Computation (APMC), Volume 224Pages 36–45https://doi.org/10.1016/j.amc.2013.07.096In this paper, the steepest descent algorithm without line search is proposed for p-Laplacian. Its search direction is the weighted preconditioned steepest descent one, and step length is estimated by a formula except the first iteration. Continuation ...
- articleDecember 2009
A descent algorithm without line search for unconstrained optimization
Applied Mathematics and Computation (APMC), Volume 215, Issue 7Pages 2528–2533https://doi.org/10.1016/j.amc.2009.08.058In this paper, a new descent algorithm for solving unconstrained optimization problem is presented. Its search direction is descent and line search procedure can be avoided except for the first iteration. It is globally convergent under mild conditions. ...