Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD

DOI10.1023/A:1021778002066MaRDI QIDQ1280097zbMATH OpenOpenAlexFDO

Authors Xibin Chen, Michael M. Kostreva

Publication date 17 May 1999

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1021778002066

zbMATH Keywords

direction-finding subproblemfeasible pointsglobal convergencemethod of feasible directionsnonlinear programming

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
• A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
• Feasible point methods and their global convergence

Cites work

• An efficient algorithm for solving inequalities
• Convergence analysis of norm-relaxed method of feasible directions
• Generalization of Murty's direct algorithm to linear and convex quadratic programming
• scientific article; zbMATH DE number 3159112 (Why is no real title available?)
• scientific article; zbMATH DE number 3993295 (Why is no real title available?)
• Methods for finding feasible points in constrained optimization
• More test examples for nonlinear programming codes
• Norm-relaxed method of feasible directions for solving nonlinear programming problems
• On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
• Rate of Convergence of a Class of Methods of Feasible Directions
• Self-tuning norm-relaxed method of feasible directions
• Test examples for nonlinear programming codes

Cited in

(10)

• A new finitely convergent algorithm for systems of nonlinear inequalities
• Sequential feasible optimal power flow in power systems
• Improving solver success in reaching feasibility for sets of nonlinear constraints
• A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
• Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
• A superlinearly convergent method of feasible directions.
• A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
• A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity
• A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
• Finitely convergent \(\varepsilon\)-generalized projection algorithm for nonlinear systems

This page was built for publication: Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD

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