Certain questions in solving block nonlinear optimization problems with coupling variables

DOI10.1007/S10559-006-0055-XMaRDI QIDQ2371676zbMATHOpenAlexFDO

Authors Yu. P. Laptin, N. G. Zhurbenko

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(5)

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

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)