A sufficient and necessary condition for nonconvex constrained optimization

DOI10.1016/S0893-9659(97)00075-XzbMath0893.90142MaRDI QIDQ1376773

C. J. Goh, Xiao Qi Yang

Publication date: 3 August 1998

Published in: Applied Mathematics Letters (Search for Journal in Brave)

zbMATH Keywords

constrained optimizationoptimality conditionsnonconvex optimizationinequality constraintsTchebyshev norm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (6)

Efficiency and approachability of nonconvex bicriteria programs ⋮ Extended Lagrange And Penalty Functions in Continuous Optimization^* ⋮ Extended Lagrange and penalty functions in optimization ⋮ Value-estimation function method for constrained global optimization ⋮ A nonlinear Lagrangian dual for integer programming ⋮ Modified Lagrangian and least root approaches for general nonlinear optimization problems

Uses Software

• Matlab
• FSQP
• FFSQP(f77)
• Optimization Toolbox

Cites Work

• Unnamed Item
• An approach to nonlinear programming

This page was built for publication: A sufficient and necessary condition for nonconvex constrained optimization