Methods for finding feasible points in constrained optimization

DOI10.2514/3.12815MaRDI QIDQ4878229zbMATH OpenOpenAlexFDO

Authors Ossama A. Elwakeil, Jasbir S. Arora

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)

Recommendations

• The constraint consensus method for finding approximately feasible points in nonlinear programs
• scientific article; zbMATH DE number 679675
• scientific article; zbMATH DE number 1488903
• Constraint consensus methods for finding interior feasible points in second-order cones
• On proving existence of feasible points in equality constrained optimization problems

Cited in

(8)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4878229)