Certain questions in solving block nonlinear optimization problems with coupling variables

DOI10.1007/S10559-006-0055-XzbMATH Open1119.90039OpenAlexW2017502119MaRDI QIDQ2371676FDOQ2371676

N. G. Zhurbenko, Yu. P. Laptin

Publication date: 5 July 2007

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-006-0055-x

Recommendations

• Decomposition in terms of variables for some optimization problems
• scientific article; zbMATH DE number 3959124
• Decomposition-aggregation method for convex programming problems
• A PRACTICAL APPROACH TO DECOMPOSABLE NONLINEAR PROGRAMMING PROBLEMS
• scientific article; zbMATH DE number 4009672

zbMATH Keywords

decompositionconvex programmingnonsmooth-optimization methods\(\epsilon\)-subgradient

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52)

Cites Work

• Nondifferentiable optimization and polynomial problems
• Mixed method for solving the general convex programming problem
• Decomposition in terms of variables for some optimization problems

Cited In (5)

• Problems related to estimating the coefficients of exact penalty functions
• Decomposition in terms of variables for some optimization problems
• A PRACTICAL APPROACH TO DECOMPOSABLE NONLINEAR PROGRAMMING PROBLEMS
• Exact penalty functions and convex extensions of functions in schemes of decomposition in variables
• An approach to the solution of nonlinear unconstrained optimization problems

This page was built for publication: Certain questions in solving block nonlinear optimization problems with coupling variables

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