Solving optimization problem when the optimization objective is implicit

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
0
down vote

favorite
2












I would like to solve an optimization problem which has the following format:



$$max_x (y + f(x)), y in mathbbR, x in mathbbR^n$$ and $y$ can only be solved through an implicit function with $x, g(x,y)=c$.



More specifically, given vectors $a in mathbbR^n, b in mathbbR^n, c in mathbbR^n$, we have $f(x)=fracsum_i x_i a_i c_isum_i x_i a_i$



we have the implicit function $g$
$$sum_i=1^i=n x_i a_i = sum_i=1^i=n [sum_k=1^k=b[i] fracc_i x_iy^k]$$



So how should I proceed to solve this optimization? should I use approximation to solve $y=g'(x)$ ?



Any help appreciated !! Thanks !!!







share|cite|improve this question





















  • can you share $f$ and $g$ with us?
    – LinAlg
    Jul 25 at 14:15










  • Are you able to differentiate $g(x,y)$ to determine the rate at which changing $x$ changes $y$? Or conversely, since you make no mention of constraints, why not treat $x$ and $f(x)$ as depending on the choice of $y$? You've told us nothing about $g(x,y)$, so it's guesswork how one solves $g(x,y)=c$ in either direction.
    – hardmath
    Jul 25 at 14:18










  • @LinAlg I have edited the post thanks!
    – Yue X
    Jul 25 at 14:33










  • @hardmath I have edited the post thanks!
    – Yue X
    Jul 25 at 14:33






  • 2




    There is nothing special about this. This is an equality constrained nonlinear optimization problem in $x$ and $y$.
    – Johan Löfberg
    Jul 26 at 15:43














up vote
0
down vote

favorite
2












I would like to solve an optimization problem which has the following format:



$$max_x (y + f(x)), y in mathbbR, x in mathbbR^n$$ and $y$ can only be solved through an implicit function with $x, g(x,y)=c$.



More specifically, given vectors $a in mathbbR^n, b in mathbbR^n, c in mathbbR^n$, we have $f(x)=fracsum_i x_i a_i c_isum_i x_i a_i$



we have the implicit function $g$
$$sum_i=1^i=n x_i a_i = sum_i=1^i=n [sum_k=1^k=b[i] fracc_i x_iy^k]$$



So how should I proceed to solve this optimization? should I use approximation to solve $y=g'(x)$ ?



Any help appreciated !! Thanks !!!







share|cite|improve this question





















  • can you share $f$ and $g$ with us?
    – LinAlg
    Jul 25 at 14:15










  • Are you able to differentiate $g(x,y)$ to determine the rate at which changing $x$ changes $y$? Or conversely, since you make no mention of constraints, why not treat $x$ and $f(x)$ as depending on the choice of $y$? You've told us nothing about $g(x,y)$, so it's guesswork how one solves $g(x,y)=c$ in either direction.
    – hardmath
    Jul 25 at 14:18










  • @LinAlg I have edited the post thanks!
    – Yue X
    Jul 25 at 14:33










  • @hardmath I have edited the post thanks!
    – Yue X
    Jul 25 at 14:33






  • 2




    There is nothing special about this. This is an equality constrained nonlinear optimization problem in $x$ and $y$.
    – Johan Löfberg
    Jul 26 at 15:43












up vote
0
down vote

favorite
2









up vote
0
down vote

favorite
2






2





I would like to solve an optimization problem which has the following format:



$$max_x (y + f(x)), y in mathbbR, x in mathbbR^n$$ and $y$ can only be solved through an implicit function with $x, g(x,y)=c$.



More specifically, given vectors $a in mathbbR^n, b in mathbbR^n, c in mathbbR^n$, we have $f(x)=fracsum_i x_i a_i c_isum_i x_i a_i$



we have the implicit function $g$
$$sum_i=1^i=n x_i a_i = sum_i=1^i=n [sum_k=1^k=b[i] fracc_i x_iy^k]$$



So how should I proceed to solve this optimization? should I use approximation to solve $y=g'(x)$ ?



Any help appreciated !! Thanks !!!







share|cite|improve this question













I would like to solve an optimization problem which has the following format:



$$max_x (y + f(x)), y in mathbbR, x in mathbbR^n$$ and $y$ can only be solved through an implicit function with $x, g(x,y)=c$.



More specifically, given vectors $a in mathbbR^n, b in mathbbR^n, c in mathbbR^n$, we have $f(x)=fracsum_i x_i a_i c_isum_i x_i a_i$



we have the implicit function $g$
$$sum_i=1^i=n x_i a_i = sum_i=1^i=n [sum_k=1^k=b[i] fracc_i x_iy^k]$$



So how should I proceed to solve this optimization? should I use approximation to solve $y=g'(x)$ ?



Any help appreciated !! Thanks !!!









share|cite|improve this question












share|cite|improve this question




share|cite|improve this question








edited Jul 27 at 14:07









Michael Grant

14.6k11743




14.6k11743









asked Jul 25 at 14:11









Yue X

12




12











  • can you share $f$ and $g$ with us?
    – LinAlg
    Jul 25 at 14:15










  • Are you able to differentiate $g(x,y)$ to determine the rate at which changing $x$ changes $y$? Or conversely, since you make no mention of constraints, why not treat $x$ and $f(x)$ as depending on the choice of $y$? You've told us nothing about $g(x,y)$, so it's guesswork how one solves $g(x,y)=c$ in either direction.
    – hardmath
    Jul 25 at 14:18










  • @LinAlg I have edited the post thanks!
    – Yue X
    Jul 25 at 14:33










  • @hardmath I have edited the post thanks!
    – Yue X
    Jul 25 at 14:33






  • 2




    There is nothing special about this. This is an equality constrained nonlinear optimization problem in $x$ and $y$.
    – Johan Löfberg
    Jul 26 at 15:43
















  • can you share $f$ and $g$ with us?
    – LinAlg
    Jul 25 at 14:15










  • Are you able to differentiate $g(x,y)$ to determine the rate at which changing $x$ changes $y$? Or conversely, since you make no mention of constraints, why not treat $x$ and $f(x)$ as depending on the choice of $y$? You've told us nothing about $g(x,y)$, so it's guesswork how one solves $g(x,y)=c$ in either direction.
    – hardmath
    Jul 25 at 14:18










  • @LinAlg I have edited the post thanks!
    – Yue X
    Jul 25 at 14:33










  • @hardmath I have edited the post thanks!
    – Yue X
    Jul 25 at 14:33






  • 2




    There is nothing special about this. This is an equality constrained nonlinear optimization problem in $x$ and $y$.
    – Johan Löfberg
    Jul 26 at 15:43















can you share $f$ and $g$ with us?
– LinAlg
Jul 25 at 14:15




can you share $f$ and $g$ with us?
– LinAlg
Jul 25 at 14:15












Are you able to differentiate $g(x,y)$ to determine the rate at which changing $x$ changes $y$? Or conversely, since you make no mention of constraints, why not treat $x$ and $f(x)$ as depending on the choice of $y$? You've told us nothing about $g(x,y)$, so it's guesswork how one solves $g(x,y)=c$ in either direction.
– hardmath
Jul 25 at 14:18




Are you able to differentiate $g(x,y)$ to determine the rate at which changing $x$ changes $y$? Or conversely, since you make no mention of constraints, why not treat $x$ and $f(x)$ as depending on the choice of $y$? You've told us nothing about $g(x,y)$, so it's guesswork how one solves $g(x,y)=c$ in either direction.
– hardmath
Jul 25 at 14:18












@LinAlg I have edited the post thanks!
– Yue X
Jul 25 at 14:33




@LinAlg I have edited the post thanks!
– Yue X
Jul 25 at 14:33












@hardmath I have edited the post thanks!
– Yue X
Jul 25 at 14:33




@hardmath I have edited the post thanks!
– Yue X
Jul 25 at 14:33




2




2




There is nothing special about this. This is an equality constrained nonlinear optimization problem in $x$ and $y$.
– Johan Löfberg
Jul 26 at 15:43




There is nothing special about this. This is an equality constrained nonlinear optimization problem in $x$ and $y$.
– Johan Löfberg
Jul 26 at 15:43















active

oldest

votes











Your Answer




StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);








 

draft saved


draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2862451%2fsolving-optimization-problem-when-the-optimization-objective-is-implicit%23new-answer', 'question_page');

);

Post as a guest



































active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes










 

draft saved


draft discarded


























 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2862451%2fsolving-optimization-problem-when-the-optimization-objective-is-implicit%23new-answer', 'question_page');

);

Post as a guest













































































Comments

Popular posts from this blog

What is the equation of a 3D cone with generalised tilt?

Relationship between determinant of matrix and determinant of adjoint?

Color the edges and diagonals of a regular polygon