New active set identification for general constrained optimization and minimax problems

DOI10.1016/j.jmaa.2014.07.041zbMath1310.90119OpenAlexW2137441021MaRDI QIDQ743206

Yi Liu, Jin-Bao Jian, Zhi Bin Zhu

Publication date: 23 September 2014

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2014.07.041

zbMATH Keywords

constrained optimizationactive constraintsminimax problemsidentification technique

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Nonlinear programming (90C30)

Related Items (3)

A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization ⋮ Primal-dual interior point QP-free algorithm for nonlinear constrained optimization ⋮ An active-set algorithm and a trust-region approach in constrained minimax problem

Cites Work

• Unnamed Item
• Unnamed Item
• Diagonal bundle method for nonsmooth sparse optimization
• On the accurate identification of active set for constrained minimax problems
• A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
• A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization
• Local convergence of interior-point algorithms for degenerate monotone LCP
• Identification of the optimal active set in a noninterior continuation method for LCP
• On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm
• A new penalty method for nonlinear programming
• Hybrid approach with active set identification for mathematical programs with complementarity constraints
• Identifying Activity
• Identifiable Surfaces in Constrained Optimization
• Convergence of Trust Region Algorithms for Optimization with Bounds when Strict Complementarity Does Not Hold
• Active Set Identification in Nonlinear Programming
• On the Identification of Active Constraints II: The Nonconvex Case
• On the Identification of Active Constraints
• On the Accurate Identification of Active Constraints
• An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
• Active Sets, Nonsmoothness, and Sensitivity

This page was built for publication: New active set identification for general constrained optimization and minimax problems