An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments
DOI10.1016/J.AMC.2011.02.012zbMATH Open1220.65070OpenAlexW2122230127MaRDI QIDQ531641FDOQ531641
Authors: Xing-De Mo, Jinbao Jian, Su-Min Yang 
Publication date: 19 April 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.02.012
Recommendations
- An improved infeasible SSLE method for constrained optimization without strict complementarity
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization
- A modified strongly sub-feasible SQP algorithm for constrained optimization and numerical experiments
- A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems
- A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
- scientific article; zbMATH DE number 1437399
- scientific article; zbMATH DE number 5898052
- Publication:4487995
- A strongly sub-feasible direction method with subgradient selection for nonsmooth optimization
convergenceconstrained optimizationnumerical experimentsbidirectional Armijo linemethod of strongly sub-feasible directionssequential systems of linear equations (SSLE)
Cites Work
- CUTE
- 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 Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- Title not available (Why is that?)
- Two extension models of SQP and SSLE algorithms for optimizaiton and their superlinear and quadratic convergence
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
- A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity
- A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences
- An improved infeasible SSLE method for constrained optimization without strict complementarity
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization
Uses Software
This page was built for publication: An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q531641)
