How I can find an optimal solution for a model with concave-convex objective function?

My objective function is sum of three functions, 2 linear functions and a concave function
($1-\exp(x)$); constraints of my model are convex. How can I obtain optimal solution from this problem?

-

1 Answer

Solve $\Delta f_{vex}(x^{n+1})=-\Delta g_{cave}(x^n)$ where $f_{vex}(.)$ is the convex part, being the sum of the two linear functions and $g_{cave}$ is the concave part and $x^{n}$ denotes the $n^{th}$iterate of the solution. This is also known as the concave-convex procedure.

-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 6, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9166330695152283, "perplexity_flag": "head"}