A Mixed and Superlinearly Convergent Algorithm for Constrained Optimization

DOI10.1080/10556780310001607965zbMATH Open1142.90492OpenAlexW1980761837MaRDI QIDQ4653552FDOQ4653552

Authors: Yifan Xu 

Publication date: 7 March 2005

Published in: Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780310001607965

Recommendations

• A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations
• A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence
• A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
• scientific article
• A superlinearly convergent method to linearly constrained optimization problems under degeneracy
• scientific article
• scientific article; zbMATH DE number 851560
• A superlinearly convergent hybrid algorithm for solving nonlinear programming
• A superlinearly convergent primal — dual algorithm model for constrained optimization problems with bounded variables
• A robust superlinearly convergent algorithm for linearly constrained optimization problems under degeneracy

zbMATH Keywords

convergenceconstrained optimizationSystem of linear equationsQP-free

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Cites Work

• Superlinearly convergent variable metric algorithms for general nonlinear programming problems
• Local analysis of Newton-type methods for variational inequalities and nonlinear programming
• More test examples for nonlinear programming codes
• Test examples for nonlinear programming codes
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
• A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
• A surperlinearly convergent algorithm for constrained optimization problems
• Algorithms for nonlinear constraints that use lagrangian functions
• Sequential Quadratic Programming with Penalization of the Displacement

Cited In (12)

• Title not available (Why is that?)
• 1.5-\(Q\)-superlinear convergence of an exterior-point method for constrained optimization
• A QP-free and superlinearly convergent algorithm for inequality constrained optimizations
• A note on the comparison of two algorithms for the equality constrained optimizations
• Descending dimension algorithm for nonlinear optimization problem with mixed linear constraints
• Pénalités mixtes : un algorithme superlinéaire en deux étapes
• A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations
• A superlinearly convergent method to linearly constrained optimization problems under degeneracy
• Sequential systems of linear equations algorithm for nonlinear optimization problems -- general constrained problems.
• On combining feasibility, descent and superlinear convergence in inequality constrained optimization
• A superlinearly convergent primal — dual algorithm model for constrained optimization problems with bounded variables
• Title not available (Why is that?)

This page was built for publication: A Mixed and Superlinearly Convergent Algorithm for Constrained Optimization

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