One variant of the objective function parameterization method and its implementation

DOI10.1134/S1995080223010468zbMATH Open1519.90179OpenAlexW4377003524MaRDI QIDQ6040381

Igor' Yaroslavich Zabotin, K. E. Kazaeva, O. N. Shulgina

Publication date: 25 May 2023

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995080223010468

zbMATH Keywords

convex programmingcutting planesobjective functionconditional minimizationapproximating setsfunction epigraphiteration pointmethod convergencemethod implementation

Mathematics Subject Classification ID

Convex programming (90C25)

Cites Work

• Cutting-plane method based on epigraph approximation with discarding the cutting planes
• A cutting method for finding discrete minimax with dropping of cutting planes
• A minimization method with approximation of feasible set and epigraph of objective function
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• A filled function method with one parameter for unconstrained global optimization 👍 👎
• Approximation of the optimum function in procedures of parametric optimization 👍 👎
• The modified objective function method for univex multiobjective variational problems 👍 👎
• A function approximation approach for parametric optimization 👍 👎
• A method for the parametric representation of objective functions in conditional multicriterial optimization 👍 👎

This page was built for publication: One variant of the objective function parameterization method and its implementation