TITLE

Construction of sliding constraint surfaces based on QP model in multi-step inverse analysis

AUTHOR(S)
Liu, Weijie; Hu, Ping; Zhou, Ping; Zhang, Xiangkui
PUB. DATE
May 2013
SOURCE
AIP Conference Proceedings;May2013, Vol. 1532 Issue 1, p388
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
In this paper, the sliding constraint surfaces are automatically generated by a Pseudo-Minimum Area method (PMA), and the Initial Guess is generated on the constructed sliding constraint surface based on the One-step inverse approach. In the PMA method, the three-dimensional construction problem of sliding constraint surfaces was converted into a Quadratic Programming (QP) problem from the perspective of optimization. Since the high-efficiency solving of QP problems, the sliding constraint surfaces can be generated efficiently. Constructed sliding constraint surfaces and Initial guesses are applied to the multi-step drawing process. The numerical analysis result is compared with One-step inverse analysis and DYNAFORM to evaluate the effectiveness of the multi-step inverse analysis.
ACCESSION #
87656138

 

Related Articles

  • An inexact restoration strategy for the globalization of the sSQP method. Fern├índez, D.; Pilotta, E.; Torres, G. // Computational Optimization & Applications;Apr2013, Vol. 54 Issue 3, p595 

    A globally convergent algorithm based on the stabilized sequential quadratic programming (sSQP) method is presented in order to solve optimization problems with equality constraints and bounds. This formulation has attractive features in the sense that constraint qualifications are not needed at...

  • A BFGS trust-region method for nonlinear equations. Yuan, Gonglin; Wei, Zengxin; Lu, Xiwen // Computing;Aug2011, Vol. 92 Issue 4, p317 

    In this paper, a new trust-region subproblem combining with the BFGS update is proposed for solving nonlinear equations, where the trust region radius is defined by a new way. The global convergence without the nondegeneracy assumption and the quadratic convergence are obtained under suitable...

  • A global continuation algorithm for solving binary quadratic programming problems. Pan, Shaohua; Tan, Tao; Jiang, Yuxi // Computational Optimization & Applications;Dec2008, Vol. 41 Issue 3, p349 

    In this paper, we propose a new continuous approach for the unconstrained binary quadratic programming (BQP) problems based on the Fischer-Burmeister NCP function. Unlike existing relaxation methods, the approach reformulates a BQP problem as an equivalent continuous optimization problem, and...

  • An inexact spectral bundle method for convex quadratic semidefinite programming. Lin, Huiling // Computational Optimization & Applications;Sep2012, Vol. 53 Issue 1, p45 

    We present an inexact spectral bundle method for solving convex quadratic semidefinite optimization problems. This method is a first-order method, hence requires much less computational cost in each iteration than second-order approaches such as interior-point methods. In each iteration of our...

  • New Method for Finding an Optimal Solution to Quadratic Programming Problems. Chikhaoui, A.; Djebbar, B.; Mekki, R. // Journal of Applied Sciences;2010, Vol. 10 Issue 15, p1627 

    The aim of this study is to present a new method for finding an optimal solution to quadratic programming problems. The principle of the method is based on calculating the value of critical point. If the critical point belongs to the set of feasible solutions, so the optimal solution to our...

  • Minimum Norm Solution to the Absolute Value Equation in the Convex Case. Ketabchi, Saeed; Moosaei, Hossein // Journal of Optimization Theory & Applications;Sep2012, Vol. 154 Issue 3, p1080 

    In this paper, we give an algorithm to compute the minimum norm solution to the absolute value equation (AVE) in a special case. We show that this solution can be obtained from theorems of the alternative and a useful characterization of solution sets of convex quadratic programs. By using an...

  • Sl1QP Based Algorithm with Trust Region Technique for Solving Nonlinear Second-Order Cone Programming Problems. OKUNO, Takayuki; YASUDA, Kohei; HAYASHI, Shunsuke // Interdisciplinary Information Sciences;2015, Vol. 21 Issue 2, p97 

    In this paper, we propose an algorithm based on Fletcher's Sl1QP method and the trust region technique for solving Nonlinear Second-Order Cone Programming (NSOCP) problems. The Sl1QP method was originally developed for nonlinear optimization problems with inequality constraints. It converts a...

  • The practical behavior of the homogeneous self-dual formulations in interior point methods. Meszaros, Csaba // Central European Journal of Operations Research;Dec2015, Vol. 23 Issue 4, p913 

    Interior point methods proved to be efficient and robust tools for solving large-scale optimization problems. The standard infeasible-start implementations scope very well with wide variety of problem classes, their only serious drawback is that they detect primal or dual infeasibility by...

  • Solution of a Probabilistic Inventory Model with Chance Constraints: A General Fuzzy Programming and Intuitionistic Fuzzy Optimization Approach. Banerjee, R.; Banerjee, S. // International Journal of Pure & Applied Sciences & Technology;Mar2012, Vol. 9 Issue 1, p20 

    This paper considers a probabilistic inventory model with uniform leadtime demand and fuzzy cost components under probabilistic and imprecise constraints. Firstly we solve the model by general fuzzy non-linear programming technique. Then intuitionistic fuzzy optimization technique is applied and...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics