Remarks on a benchmark nonlinear constrained optimization problem

DOI10.1016/S1004-4132(06)60095-9MaRDI QIDQ2936277zbMATH OpenOpenAlexFDO

Authors Guo-Jin Tang, Ya-zhong Luo, Yong-Jun Lei

Publication date 15 December 2014

Published in Journal of Systems Engineering and Electronics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s1004-4132(06)60095-9

zbMATH Keywords

Kuhn-Tucker theoremnonlinear constrained optimizationparallel simulated annealing

Mathematics Subject Classification ID

Duality theory (optimization) (49N15) Nonlinear programming (90C30)

Recommendations

• A nonlinear Lagrangian approach to constrained optimization problems
• scientific article; zbMATH DE number 124136
• scientific article; zbMATH DE number 4086396
• Remark on a convex nonlinear problem
• Remarks on a nonlinear complementarity problem
• A nonlinear Lagrangian for constrained optimization problems
• Nonsmooth Optimum Problems with Constraints
• On constrained optimization problems with nonsmooth cost functionals
• Optimality Conditions for Nonconvex Constrained Optimization Problems
• Remarks on the Newton method for solving nonlinear equality constrained optimization problems

Cited in

(1)

• A linear constrained optimization Benchmark for probabilistic search algorithms: the rotated Klee-Minty problem

This page was built for publication: Remarks on a benchmark nonlinear constrained optimization problem

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