An SQP method for general nonlinear programs using only equality constrained subproblems

1998 ◽  
Vol 82 (3) ◽  
pp. 413-448 ◽  
Author(s):  
P. Spellucci
Keyword(s):  
Sqp Method ◽  
Nonlinear Programs

scholarly journals A smoothing SQP method for nonlinear programs with stability constraints arising from power systems

2010 ◽  
Vol 51 (1) ◽  
pp. 175-197 ◽  
Author(s):  
Xiaojiao Tong ◽  
Liqun Qi ◽  
Soon-Yi Wu ◽  
Felix F. Wu
Keyword(s):  
Power Systems ◽  
Sqp Method ◽  
Nonlinear Programs

Optimization of Cold-Formed Channel Sections Using Imperialist Competitive Algorithm

2012 ◽  
Vol 166-169 ◽  
pp. 493-496
Author(s):  
Roya Kohandel ◽  
Behzad Abdi ◽  
Poi Ngian Shek ◽  
M.Md. Tahir ◽  
Ahmad Beng Hong Kueh
Keyword(s):  
Sequential Quadratic Programming ◽  
Optimization Problems ◽  
Imperialist Competitive Algorithm ◽  
Computational Method ◽  
Compression Force ◽  
Sqp Method ◽  
Competitive Algorithm ◽  
Different Types ◽  
Formed Channel ◽  
Good Agreement

The Imperialist Competitive Algorithm (ICA) is a novel computational method based on the concept of socio-political motivated strategy, which is usually used to solve different types of optimization problems. This paper presents the optimization of cold-formed channel section subjected to axial compression force utilizing the ICA method. The results are then compared to the Genetic Algorithm (GA) and Sequential Quadratic Programming (SQP) algorithm for validation purpose. The results obtained from the ICA method is in good agreement with the GA and SQP method in terms of weight but slightly different in the geometry shape.

PLANNING FOR ACCELERATED LIFE TESTS

1999 ◽  
Vol 06 (03) ◽  
pp. 265-275 ◽  
Author(s):  
LOON-CHING TANG
Keyword(s):  
Acceleration Factor ◽  
Test Time ◽  
Initial Sample ◽  
Lower Stress ◽  
Nonlinear Programs ◽  
Accelerated Life Tests ◽  
Accelerated Life ◽  
Stress Levels ◽  
Life Tests ◽  
Sample Allocation

We present two alternative perspectives to the current way of planning for constant-stress accelerated life tests (CSALTs) and step-stress ALT (SSALT). In 3-stress CSALT, we consider test plans that not only optimize the stress levels but also optimize the sample allocation. The resulting allocations also limit the chances of inconsistency when data are plotted on a probability plot. For SSALT, we consider test plans that not only optimize both stress levels and holding times, but also achieve a target acceleration factor that meets the test time constraint with the desirable fraction of failure. The results for both problems suggest that the statistically optimal way to increase acceleration factor in an ALT is to increase lower stress levels and; in the case of CSALT, to decrease their initial sample allocations; in the case of SSALT, to reduce their initial hold times. Both problems are formulated as constrained nonlinear programs.

scholarly journals Nonlinear Steady-State Optimization of Large-Scale Gas Transmission Networks

Energies ◽  
2021 ◽  
Vol 14 (10) ◽  
pp. 2832
Author(s):  
Andrzej J. Osiadacz ◽  
Małgorzata Kwestarz
Keyword(s):  
Steady State ◽  
Large Scale ◽  
Optimization Problem ◽  
Operating Cost ◽  
Network Efficiency ◽  
Major Objective ◽  
Transmission Networks ◽  
Sqp Method ◽  
Gas Network ◽  
Compressor Power

The major optimization problem of the gas transmission system is to determine how to operate the compressors in a network to deliver a given flow within the pressure bounds while using minimum compressor power (minimum fuel consumption or maximum network efficiency). Minimization of fuel usage is a major objective to control gas transmission costs. This is one of the problems that has received most of the attention from both practitioners and researchers because of its economic impact. The article describes the algorithm of steady-state optimization of a high-pressure gas network of any structure that minimizes the operating cost of compressors. The developed algorithm uses the “sequential quadratic programming (SQP)” method. The tests carried out on the real network segment confirmed the correctness of the developed algorithm and, at the same time, proved its computational efficiency. Computational results obtained with the SQP method demonstrate the viability of this approach.

An SQP Method for Equality Constrained Optimization on Hilbert Manifolds

2021 ◽  
Vol 31 (3) ◽  
pp. 2255-2284
Author(s):  
Anton Schiela ◽  
Julian Ortiz
Keyword(s):  
Constrained Optimization ◽  
Sqp Method ◽  
Equality Constrained Optimization
Sign in / Sign up

Export Citation Format

Share Document