Methods for finding feasible points in constrained optimization

DOI10.2514/3.12815zbMath0862.73040OpenAlexW2038112867MaRDI QIDQ4878229

Jasbir S. Arora, Ossama A. Elwakeil

Publication date: 22 May 1996

Published in: AIAA Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2514/3.12815

zbMATH Keywords

penalty methodsprimal methods

Mathematics Subject Classification ID

Optimization problems in solid mechanics (74P99)

Related Items (6)

Finitely convergent \(\varepsilon\)-generalized projection algorithm for nonlinear systems ⋮ A new \(\varepsilon \)-generalized projection method of strongly sub-feasible directions for inequality constrained optimization ⋮ Improving solver success in reaching feasibility for sets of nonlinear constraints ⋮ Constraint consensus concentration for identifying disjoint feasible regions in nonlinear programmes ⋮ Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD ⋮ Sequential feasible optimal power flow in power systems

This page was built for publication: Methods for finding feasible points in constrained optimization