# Sequential approximate optimization by dual method based on two-point diagonal quadratic approximation

Seonho Park, Sangjin Jung, Seung Hyun Jeong, Dong Hoon Choi

Research output: Contribution to journalArticlepeer-review

## Abstract

We present a new dual sequential approximate optimization (SAO) algorithm called SD-TDQAO (sequential dual two-point diagonal quadratic approximate optimization). This algorithm solves engineering optimization problems with a nonlinear objective and nonlinear inequality constraints. The two-point diagonal quadratic approximation (TDQA) was originally non-convex and inseparable quadratic approximation in the primal design variable space. To use the dual method, SD-TDQAO uses diagonal quadratic explicit separable approximation; this can easily ensure convexity and separability. An important feature is that the second-derivative terms of the quadratic approximation are approximated by TDQA, which uses only information on the function and the derivative values at two consecutive iteration points. The algorithm will be illustrated using mathematical and topological test problems, and its performance will be compared with that of the MMA algorithm.

Original language English (US) 259-266 8 Transactions of the Korean Society of Mechanical Engineers, A 35 3 https://doi.org/10.3795/KSME-A.2011.35.3.259 Published - Mar 1 2011

## All Science Journal Classification (ASJC) codes

• Mechanical Engineering

## Fingerprint

Dive into the research topics of 'Sequential approximate optimization by dual method based on two-point diagonal quadratic approximation'. Together they form a unique fingerprint.
{"ft_lang_label":"__label__en","ft_lang_prob":0.87208587,"math_prob":0.70576245,"size":1255,"snap":"2022-05-2022-21","text_gpt3_token_len":254,"char_repetition_ratio":0.13269384,"word_repetition_ratio":0.0,"special_character_ratio":0.18406375,"punctuation_ratio":0.059139784,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.96410537,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-24T12:59:39Z\",\"WARC-Record-ID\":\"<urn:uuid:3c2c2131-4688-4513-a11e-6ebb1a6018c5>\",\"Content-Length\":\"41164\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c5dbf75c-4d40-4fb0-b8e4-60468d1aaed1>\",\"WARC-Concurrent-To\":\"<urn:uuid:0067bbe8-0b89-4bdb-b2fc-c2a82c35929c>\",\"WARC-IP-Address\":\"3.90.122.189\",\"WARC-Target-URI\":\"https://pennstate.pure.elsevier.com/en/publications/sequential-approximate-optimization-by-dual-method-based-on-two-p\",\"WARC-Payload-Digest\":\"sha1:4HMXSXYHLROLTIRSVJ5NUQ35FHZVSOEM\",\"WARC-Block-Digest\":\"sha1:ZG2ECMQX5OAK32MRCOEEBT2YVVZD3DLI\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652662572800.59_warc_CC-MAIN-20220524110236-20220524140236-00642.warc.gz\"}"}