{"id":2037,"date":"2016-02-10T14:15:18","date_gmt":"2016-02-10T13:15:18","guid":{"rendered":"http:\/\/smart--grid.net\/?page_id=2037"},"modified":"2022-12-03T22:58:55","modified_gmt":"2022-12-03T21:58:55","slug":"methodes-de-descente","status":"publish","type":"page","link":"https:\/\/complex-systems-ai.com\/es\/algoritmos-estocasticos\/metodos-de-descenso\/","title":{"rendered":"M\u00e9todos de descenso"},"content":{"rendered":"<div data-elementor-type=\"wp-page\" data-elementor-id=\"2037\" class=\"elementor elementor-2037\">\n\t\t\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-39bf230 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"39bf230\" data-element_type=\"section\" data-e-type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-33 elementor-top-column elementor-element elementor-element-a3094b1\" data-id=\"a3094b1\" data-element_type=\"column\" data-e-type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-249fd0b elementor-align-justify elementor-widget elementor-widget-button\" data-id=\"249fd0b\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"button.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-button-wrapper\">\n\t\t\t\t\t<a class=\"elementor-button elementor-button-link elementor-size-sm\" href=\"https:\/\/complex-systems-ai.com\/es\/algoritmos-estocasticos\/\">\n\t\t\t\t\t\t<span class=\"elementor-button-content-wrapper\">\n\t\t\t\t\t\t\t\t\t<span class=\"elementor-button-text\">Algoritmos estoc\u00e1sticos<\/span>\n\t\t\t\t\t<\/span>\n\t\t\t\t\t<\/a>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t<div class=\"elementor-column elementor-col-33 elementor-top-column elementor-element elementor-element-8f7103b\" data-id=\"8f7103b\" data-element_type=\"column\" data-e-type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-303c0d3 elementor-align-justify elementor-widget elementor-widget-button\" data-id=\"303c0d3\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"button.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-button-wrapper\">\n\t\t\t\t\t<a class=\"elementor-button elementor-button-link elementor-size-sm\" href=\"https:\/\/complex-systems-ai.com\/es\/\">\n\t\t\t\t\t\t<span class=\"elementor-button-content-wrapper\">\n\t\t\t\t\t\t\t\t\t<span class=\"elementor-button-text\">Pagina de inicio<\/span>\n\t\t\t\t\t<\/span>\n\t\t\t\t\t<\/a>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t<div class=\"elementor-column elementor-col-33 elementor-top-column elementor-element elementor-element-f41ff6d\" data-id=\"f41ff6d\" data-element_type=\"column\" data-e-type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-5964b09 elementor-align-justify elementor-widget elementor-widget-button\" data-id=\"5964b09\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"button.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-button-wrapper\">\n\t\t\t\t\t<a class=\"elementor-button elementor-button-link elementor-size-sm\" href=\"https:\/\/fr.wikipedia.org\/wiki\/Algorithme_du_gradient\" target=\"_blank\" rel=\"noopener\">\n\t\t\t\t\t\t<span class=\"elementor-button-content-wrapper\">\n\t\t\t\t\t\t\t\t\t<span class=\"elementor-button-text\">Wiki<\/span>\n\t\t\t\t\t<\/span>\n\t\t\t\t\t<\/a>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-272050ba elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"272050ba\" data-element_type=\"section\" data-e-type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-46998337\" data-id=\"46998337\" data-element_type=\"column\" data-e-type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-669d3826 elementor-widget elementor-widget-text-editor\" data-id=\"669d3826\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t\n<div id=\"ez-toc-container\" class=\"ez-toc-v2_0_82_2 counter-hierarchy ez-toc-counter ez-toc-grey ez-toc-container-direction\">\n<div class=\"ez-toc-title-container\">\n<p class=\"ez-toc-title\" style=\"cursor:inherit\">Contenido<\/p>\n<span class=\"ez-toc-title-toggle\"><a href=\"#\" class=\"ez-toc-pull-right ez-toc-btn ez-toc-btn-xs ez-toc-btn-default ez-toc-toggle\" aria-label=\"Tabla de contenido alternativo\"><span class=\"ez-toc-js-icon-con\"><span class=\"\"><span class=\"eztoc-hide\" style=\"display:none;\">Palanca<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #999;color:#999\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewbox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #999;color:#999\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewbox=\"0 0 24 24\" version=\"1.2\" baseprofile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/span><\/a><\/span><\/div>\n<nav><ul class='ez-toc-list ez-toc-list-level-1' ><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/complex-systems-ai.com\/es\/algoritmos-estocasticos\/metodos-de-descenso\/#Methodes-de-descente\" >M\u00e9todos de descenso<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/complex-systems-ai.com\/es\/algoritmos-estocasticos\/metodos-de-descenso\/#Descente-simple\" >Descenso simple<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/complex-systems-ai.com\/es\/algoritmos-estocasticos\/metodos-de-descenso\/#Plus-grande-descente\" >Mayor descenso<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/complex-systems-ai.com\/es\/algoritmos-estocasticos\/metodos-de-descenso\/#Descente-multi-start\" >Descenso de m\u00faltiples salidas<\/a><\/li><\/ul><\/nav><\/div>\n<h2><span class=\"ez-toc-section\" id=\"Methodes-de-descente\"><\/span>M\u00e9todos de descenso<span class=\"ez-toc-section-end\"><\/span><\/h2>\n<p>Como indica el nombre expl\u00edcito, los m\u00e9todos de descenso, o b\u00fasqueda local, consisten en &quot;deslizar&quot; a lo largo de la funci\u00f3n objetivo hasta encontrar un \u00f3ptimo local, es decir, donde el descenso ya no es posible. Hay varios tipos de m\u00e9todos de descenso que describiremos aqu\u00ed.<\/p>\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Descente-simple\"><\/span>Descenso simple<span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n<div style=\"padding: 5px; background-color: #d5edff; border: 2px solid #3c95e8; -moz-border-radius: 9px; -khtml-border-radius: 9px; -webkit-border-radius: 9px; border-radius: 9px;\">A partir de una soluci\u00f3n inicial, el algoritmo de descenso simple elige una soluci\u00f3n vecina mejor que la soluci\u00f3n actual, hasta que no puede tomar esa decisi\u00f3n.<\/div>\n\n<p>El algoritmo es como sigue:<\/p>\n\n<div style=\"padding: 3px; border: 2px dotted #a5a5a5; background-color: #f6f9fa;\">\n<pre>ENTONCES\n<strong>hacer<\/strong>\n   S<sub>(yo + 1)<\/sub> = vecino (S<sub>I<\/sub>)\n<b>   si<\/b> f (S<sub>(yo + 1)<\/sub>) &lt;f (S<sub>I<\/sub>) aceptar S<sub>(yo + 1)<\/sub>\n   <strong>terminara si<\/strong>\n<strong>tanto que<\/strong> f (S<sub>(yo + 1)<\/sub>) &lt;f (S<sub>I<\/sub>), lo que sea S<sub>(yo + 1)<\/sub> = vecino (S<sub>I<\/sub>)\n<b>regreso<\/b> R<sub>no<\/sub><\/pre>\n<\/div>\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter\"><img fetchpriority=\"high\" decoding=\"async\" class=\"alignnone wp-image-2065\" src=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/02\/descentesimple.png\" alt=\"M\u00e9todos de descenso simples de descenso.\" width=\"781\" height=\"534\" title=\"\" srcset=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/02\/descentesimple.png 781w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/02\/descentesimple-300x205.png 300w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/02\/descentesimple-768x525.png 768w\" sizes=\"(max-width: 781px) 100vw, 781px\" \/><\/figure>\n<\/div>\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Plus-grande-descente\"><\/span>Mayor descenso<span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n<p>El algoritmo es b\u00e1sicamente el mismo que para el descenso simple, solo se modifica un criterio de selecci\u00f3n de una soluci\u00f3n vecina:<\/p>\n\n<div style=\"padding: 3px; border: 2px dotted #a5a5a5; background-color: #f6f9fa;\">\n<pre>elija s &#039;vecino de s \/ f (s&#039;) &lt;f (s &#039;&#039;) o f (s &#039;) = f (s&#039; &#039;) qq es s&#039; &#039;vecino de s<\/pre>\n<\/div>\n\n<p>Por lo tanto, elegimos la soluci\u00f3n vecina que ofrezca la mejor mejora de la soluci\u00f3n actual.<\/p>\n\n<div class=\"wp-block-image\">\n<figure class=\"aligncenter\"><img decoding=\"async\" class=\"alignnone wp-image-2070\" src=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/02\/descenteplus.png\" alt=\"Descenso \u00fanico - mayor descenso\" width=\"757\" height=\"514\" title=\"\" srcset=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/02\/descenteplus.png 757w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/02\/descenteplus-300x204.png 300w\" sizes=\"(max-width: 757px) 100vw, 757px\" \/><\/figure>\n<\/div>\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Descente-multi-start\"><\/span>Descenso de m\u00faltiples salidas<span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n<p>El descenso de m\u00faltiples salidas realiza m\u00faltiples instancias de un solo descenso o un problema de descenso mayor. El algoritmo es como sigue:<\/p>\n\n<div style=\"padding: 3px; border: 2px dotted #a5a5a5; background-color: #f6f9fa;\">\n<pre>iter = 1 f (mejor) = infinito\n<strong>hacer<\/strong>\n   Elija una soluci\u00f3n de partida s<sub>O<\/sub> al azar s 0)\n   <strong>si<\/strong> f (s) &lt;f(Best) alors Best tant que iter &lt; iterMax\n<b>regreso<\/b> Bes<\/pre>\n<\/div>\n\n<h2 class=\"wp-block-heading\"><img decoding=\"async\" class=\"aligncenter wp-image-2084 size-full\" src=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/02\/descentemulti.png\" alt=\"Descenso m\u00faltiple\" width=\"751\" height=\"516\" title=\"\" srcset=\"https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/02\/descentemulti.png 751w, https:\/\/complex-systems-ai.com\/wp-content\/uploads\/2016\/02\/descentemulti-300x206.png 300w\" sizes=\"(max-width: 751px) 100vw, 751px\" \/><\/h2>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<\/div>","protected":false},"excerpt":{"rendered":"<p>P\u00e1gina de inicio de Wiki de algoritmos estoc\u00e1sticos M\u00e9todos de descenso Como sugiere el nombre que se explica por s\u00ed mismo, los m\u00e9todos de descenso, o b\u00fasqueda local, consisten en &quot;arrastrar&quot; a lo largo de... <\/p>","protected":false},"author":1,"featured_media":0,"parent":7101,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-2037","page","type-page","status-publish","hentry"],"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/pages\/2037","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/comments?post=2037"}],"version-history":[{"count":7,"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/pages\/2037\/revisions"}],"predecessor-version":[{"id":18385,"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/pages\/2037\/revisions\/18385"}],"up":[{"embeddable":true,"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/pages\/7101"}],"wp:attachment":[{"href":"https:\/\/complex-systems-ai.com\/es\/wp-json\/wp\/v2\/media?parent=2037"}],"curies":[{"name":"gracias","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}