• Home
  • Search
  • Equality-Constrained Engineering Design Optimization Using a Novel Inexact Quasi-Newton Method
  • https://doi.org/10.2514/1.j061695Copy DOI Icon

Equality-Constrained Engineering Design Optimization Using a Novel Inexact Quasi-Newton Method

Show More
  • Abstract
  • Literature Map
  • References
  • Similar Papers
Abstract

For engineering design optimization, the full-space formulation offers the potential for greater efficiency than the more commonly used reduced-space formulation. This potential is greater when the numerical model involves discretized partial differential equations or coupled disciplines. However, the full-space formulation results in a larger optimization problem with at least a factor of two increase in the number of optimization variables and equality constraints. Using Newton-type methods to solve such problems involves solving a large-scale and, often, ill-conditioned Karush–Kuhn–Tucker linear system at each optimization iteration. This can be time-consuming to solve even with a Krylov solver. If the number of iterations is reduced, the full-space formulation could be applied to a broader class of problems. This paper presents an inexact quasi-Newton algorithm with an adaptive extension for solving large-scale equality-constrained optimization problems. The new algorithm inexactly solves the Karush–Kuhn–Tucker system using new inexactness criteria that are derived to ensure a descent direction. The adaptive extension chooses the stopping condition of the Krylov solver by also taking its convergence rate into account. The paper presents results of numerical experiments applying this algorithm to three types of problems: six constrained optimization problems from the widely used CUTEst test suite, a bar thickness optimization problem, and a two-dimensional topology optimization problem. For all problems, the new algorithm consistently shows a roughly 50% reduction in the total number of Krylov solver iterations and a minimum of roughly 15% reduction in the optimization time. Moreover, the proposed approach for selecting the Krylov solver tolerance shows an improvement in all cases, whereas the existing forcing-parameter approach shows an increase in the number of Krylov iterations in some cases. These results indicate that this new method for selecting solver tolerances is effective and robust, and a good choice in algorithms that use a Krylov solver for solving the Karush–Kuhn–Tucker linear system.

Similar Papers
  • Conference Article
  • Citations2

Properties Of Iterative Algorithms In SPECT Image Reconstruction

  • Oct 22, 1990
  • B.M.W Tsui +3
  • Supplementary Content
  • Citations1

Solution of Large-scale Structured Optimization Problems with Schur-complement and Augmented Lagrangian Decomposition Methods

  • Aug 02, 2019
  • Figshare
  • Jose S Rodriguez
  • Research Article

A Reliable Approach for Terminating the GA Optimization Method

  • Dec 03, 2017
  • SHILAP Revista de lepidopterología
  • Leila Lotfi Katooli +1
  • PDF
  • Research Article

Investigating the Multi-memetic Mind Evolutionary Computation Algorithm Efficiency

  • Jan 01, 2017
  • Mathematics and Mathematical Modeling
  • M K Sakharov +1
  • Research Article
  • Citations1

An optimization method of adjoint assimilation based on the cumulative gradient: An application for correction of the bottom friction coefficient in the tidal wave model

  • Apr 20, 2023
  • Ocean Modelling
  • Jian Wang +6
  • Research Article
  • Citations11

An inexact Newton method for unconstrained total variation-based image denoising by approximate addition

  • Jan 01, 2021
  • IEEE Transactions on Emerging Topics in Computing
  • Junqi Huang +3
  • Research Article
  • Citations1

A Globalized and Preconditioned Newton-CG Solver for Metric-Aware Curved High-Order Mesh Optimization

  • Nov 30, 2023
  • Computer-Aided Design
  • Guillermo Aparicio-Estrems +2
  • Research Article
  • Citations4

DISTRIBUTED PROXIMAL-GRADIENT METHOD FOR CONVEX OPTIMIZATION WITH INEQUALITY CONSTRAINTS

  • Oct 01, 2014
  • The ANZIAM Journal
  • Jueyou Li +4
  • Conference Article

Performance Evaluation of a Parallel Algorithm for Determining All Optimal Solutions of the 1D Array Partitioning Problem

  • Oct 01, 2017
  • Hajer Salhi +2
  • PDF
  • Research Article
  • Citations1

A General Solution for the Errors in Variables (EIV) Model with Equality and Inequality Constraints

  • Sep 29, 2022
  • Applied Sciences
  • Dengshan Huang +2
  • Research Article
  • Citations2

An Empirical Approach to Optimize Nonlinear Problems of Domestic Energy Management Systems

  • Jan 01, 2023
  • Environmental and Climate Technologies
  • Fernando Carreras +1
  • Research Article
  • Citations4

Combinatorial optimization through variational quantum power method

  • Oct 01, 2021
  • Quantum Information Processing
  • Ammar Daskin
  • Research Article
  • Citations2

Exactness of the absolute value penalty function method for nonsmooth ‐invex optimization problems

  • Feb 07, 2017
  • International Transactions in Operational Research
  • Tadeusz Antczak
  • Research Article
  • Citations108

Adaptive modeling strategy for constrained global optimization with application to aerodynamic wing design

  • Apr 09, 2019
  • Aerospace Science and Technology
  • N Bartoli +7
  • Conference Article
  • Citations10

Performance Comparison of Gradient-Free Optimization Methods for Well Placement and Well Controls Optimization for Geologic CO2 Storage

  • Jun 26, 2024
  • Imaobong Tom +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.