{"entities":{"Q1573084":{"pageid":1583824,"ns":120,"title":"Item:Q1573084","lastrevid":67902768,"modified":"2026-04-12T20:06:55Z","type":"item","id":"Q1573084","labels":{"en":{"language":"en","value":"Exact penalty in d. c. programming"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1485028"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1573084$B30524A0-5B06-4F10-A69F-BCEE6BD3C041","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"0c2764d8e792f8b9645968afb01b431e580fa046","datavalue":{"value":{"text":"Exact penalty in d. c. programming","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1573084$C0A4BCB1-38E3-4493-AAD0-7C759A9B7FD9","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"b18138a5b41587a4e8e25bc74cf9eefe38b04af0","datavalue":{"value":"1006.90062","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1573084$EB11A636-2334-4153-BB7F-A2DBF6310C4E","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"4ecf65431316b32d32367d128185ed6660113059","datavalue":{"value":{"entity-type":"item","numeric-id":312191,"id":"Q312191"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1573084$B39716F8-4438-415C-9274-623C2F1C1959","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"bcd9b70351e9a1dbf79caf5d4012850ccdc03088","datavalue":{"value":{"entity-type":"item","numeric-id":246839,"id":"Q246839"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1573084$E7BFC784-BF72-48D4-95DE-DF639007A9C4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b5cd142fd9608ca28140ea980cba49bc3968d028","datavalue":{"value":{"entity-type":"item","numeric-id":246838,"id":"Q246838"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1573084$A6EDD34D-F967-4979-91E1-74A78A70105C","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"0b2751fb71d212e9eab0a41abf35a593195e2694","datavalue":{"value":{"entity-type":"item","numeric-id":172186,"id":"Q172186"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1573084$9ADCA68F-D403-4A3F-8CF9-AB6C860E338A","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"0ee4853016f302299c33887f7431c9879f60f44f","datavalue":{"value":{"time":"+2001-02-28T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1573084$5BE28BC1-998D-4ABD-89D8-102F939AEF2F","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"33509762745e87612fa8a7a4f19d591d777325d4","datavalue":{"value":"In this paper a nonconvex program (P) is considered. The objective function \\(f\\) is concave and the feasible set is the intersection of a polyedral convex set \\(K\\) with a lower level set of a concave function \\(g\\). A list of nonconvex optimization problems that can be formulated as (P) is presented. A useful tool to make more tractable (P) is to transform the problem into an equivalent one in the d.c. optimization framework, by penalizing the reverse convex constraint. In the case where \\(g\\) is nonnegative, the exact penalty approach for (P) is nothing but the Lagrangean duality relative to this problem; within this setting, the authors discuss relationships between problem (P), the penalized problems and the d.c. problem associated to the Lagrangean duality relative to (P). Their main result proves that, if \\(g\\) is nonnegative and \\(K\\) is bounded, the last two problems are equivalent. In the end, they prove that solving (P) is equivalent to solving the problem over the smaller feasible set of the vertices of \\(K\\).","type":"string"},"datatype":"string"},"type":"statement","id":"Q1573084$1183083B-CE27-4571-96C0-D00E2F8E4F8F","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"de3f3ef9349c49d788d3cdfae2b97a39b337988b","datavalue":{"value":{"entity-type":"item","numeric-id":216354,"id":"Q216354"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1573084$15963D8D-3FAD-4421-9E81-CA31C2FB19C0","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed10a41ec587cb61dc683f25ef4b3e827c7fee2f","datavalue":{"value":"90C26","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1573084$359B2010-13E7-479A-B664-A19A818DB963","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"15f4e876d21d5111ed972346cf4b55d9dc89f6a2","datavalue":{"value":"90C46","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1573084$C8CF8130-7882-479D-8B40-BF8D732F5635","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"ebb1180698d72c8e1f7c9a56e1a43b17f0592153","datavalue":{"value":"1485028","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1573084$8DD5321F-DE20-41EE-9A4C-30F753378C45","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ebc6c490a8e36b85e61ebe5c25cff8238ad5bcfc","datavalue":{"value":"nonconvex programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1573084$1E914E42-3A96-4AB2-86C4-48DBDDB002BB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"010507b3907cb525a9973ce9104ae499d01e8446","datavalue":{"value":"d.c. function","type":"string"},"datatype":"string"},"type":"statement","id":"Q1573084$03645667-410B-4D8D-B364-B43C8A124E3D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"43f9bf2b5b49d521b02e08499a9a1d8eb712a510","datavalue":{"value":"exact penalty","type":"string"},"datatype":"string"},"type":"statement","id":"Q1573084$D8A13A83-1926-4611-884D-CC1AAE56D70E","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1573084$44CF7AE9-E22E-4A17-B56D-2DBAC9EEF4FA","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"07a9ceeb133a471a872c3a1941df7118d4bb481c","datavalue":{"value":{"entity-type":"item","numeric-id":427389,"id":"Q427389"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"978afb0e6e0e289b31d9c11ea6ed630c964e89cf","datavalue":{"value":{"amount":"+0.8588398694992065","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1573084$B8C0DDF4-5FE7-407B-A780-1787164669E6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"3bc0713e74edc6af9fe1dc03a50bbd706a2d0813","datavalue":{"value":{"entity-type":"item","numeric-id":5897043,"id":"Q5897043"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"aaca377bcb0af8a47bdb1be5fffd4c22467514b1","datavalue":{"value":{"amount":"+0.8517141938209534","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1573084$15BD2362-24BD-49D3-8B5B-B43344403B2A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"1b1442a7454154c9a2b86ccd44ad1e9fbf195d87","datavalue":{"value":{"entity-type":"item","numeric-id":2421449,"id":"Q2421449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"f80b7b67931af99f8a7eff443bd70e9f856b7fed","datavalue":{"value":{"amount":"+0.8302345275878906","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1573084$9BAC98DC-2E1E-40BB-BED3-8BABFC8360F1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"2dfbe7110d7d48fd05ee3dbad6eb69192080c70e","datavalue":{"value":{"entity-type":"item","numeric-id":1772961,"id":"Q1772961"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"df314607c217d15f13e3dda4b8e1d7e6069ad370","datavalue":{"value":{"amount":"+0.803836464881897","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1573084$66EB00E3-CFF4-4269-9A2D-CF5AA231E396","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"a1b00603611495faf2814f420b382cefd46ee3f2","datavalue":{"value":{"entity-type":"item","numeric-id":1384439,"id":"Q1384439"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"933db19abf283e89cad272455aa59a1b9a54eda4","datavalue":{"value":{"amount":"+0.8029889464378357","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1573084$6571C61B-5CF3-47F1-AB7A-EFF0CF7AE1B5","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Exact penalty in d. c. programming","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Exact_penalty_in_d._c._programming"}}}}}