Abstract
A detailed description of a path-following Interior point algorithm for constrained convex programs is presented. The algorithm employs a truncated logarithmic Barrier function, which is particularly suitable to problems with many nonactive constraints. A special version of the algorithm is adopted to minmax problems. Extensive testing of the algorithms on large-scale Structural Optimization problems (truss topology design, shape design with optimized material) demonstrate their efficiency
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
