Find link

language: af: Afrikaans als: Alemannisch [Alemannic] am: አማርኛ [Amharic] an: aragonés [Aragonese] ar: العربية [Arabic] arz: مصرى [Egyptian Arabic] as: অসমীয়া [Assamese] ast: asturianu [Asturian] az: azərbaycanca [Azerbaijani] azb: تۆرکجه [Southern Azerbaijani] ba: башҡортса [Bashkir] bar: Boarisch [Bavarian] bat-smg: žemaitėška [Samogitian] be: беларуская [Belarusian] be-tarask: беларуская (тарашкевіца) [Belarusian (Taraškievica)] bg: български [Bulgarian] bn: বাংলা [Bengali] bpy: বিষ্ণুপ্রিয়া মণিপুরী [Bishnupriya Manipuri] br: brezhoneg [Breton] bs: bosanski [Bosnian] bug: ᨅᨔ ᨕᨘᨁᨗ [Buginese] ca: català [Catalan] ce: нохчийн [Chechen] ceb: Cebuano ckb: کوردیی ناوەندی [Kurdish (Sorani)] cs: čeština [Czech] cv: Чӑвашла [Chuvash] cy: Cymraeg [Welsh] da: dansk [Danish] de: Deutsch [German] el: Ελληνικά [Greek] en: English eo: Esperanto es: español [Spanish] et: eesti [Estonian] eu: euskara [Basque] fa: فارسی [Persian] fi: suomi [Finnish] fo: føroyskt [Faroese] fr: français [French] fy: Frysk [West Frisian] ga: Gaeilge [Irish] gd: Gàidhlig [Scottish Gaelic] gl: galego [Galician] gu: ગુજરાતી [Gujarati] he: עברית [Hebrew] hi: हिन्दी [Hindi] hr: hrvatski [Croatian] hsb: hornjoserbsce [Upper Sorbian] ht: Kreyòl ayisyen [Haitian] hu: magyar [Hungarian] hy: Հայերեն [Armenian] ia: interlingua [Interlingua] id: Bahasa Indonesia [Indonesian] io: Ido is: íslenska [Icelandic] it: italiano [Italian] ja: 日本語 [Japanese] jv: Basa Jawa [Javanese] ka: ქართული [Georgian] kk: қазақша [Kazakh] kn: ಕನ್ನಡ [Kannada] ko: 한국어 [Korean] ku: Kurdî [Kurdish (Kurmanji)] ky: Кыргызча [Kirghiz] la: Latina [Latin] lb: Lëtzebuergesch [Luxembourgish] li: Limburgs [Limburgish] lmo: lumbaart [Lombard] lt: lietuvių [Lithuanian] lv: latviešu [Latvian] map-bms: Basa Banyumasan [Banyumasan] mg: Malagasy min: Baso Minangkabau [Minangkabau] mk: македонски [Macedonian] ml: മലയാളം [Malayalam] mn: монгол [Mongolian] mr: मराठी [Marathi] mrj: кырык мары [Hill Mari] ms: Bahasa Melayu [Malay] my: မြန်မာဘာသာ [Burmese] mzn: مازِرونی [Mazandarani] nah: Nāhuatl [Nahuatl] nap: Napulitano [Neapolitan] nds: Plattdüütsch [Low Saxon] ne: नेपाली [Nepali] new: नेपाल भाषा [Newar] nl: Nederlands [Dutch] nn: norsk nynorsk [Norwegian (Nynorsk)] no: norsk bokmål [Norwegian (Bokmål)] oc: occitan [Occitan] or: ଓଡ଼ିଆ [Oriya] os: Ирон [Ossetian] pa: ਪੰਜਾਬੀ [Eastern Punjabi] pl: polski [Polish] pms: Piemontèis [Piedmontese] pnb: پنجابی [Western Punjabi] pt: português [Portuguese] qu: Runa Simi [Quechua] ro: română [Romanian] ru: русский [Russian] sa: संस्कृतम् [Sanskrit] sah: саха тыла [Sakha] scn: sicilianu [Sicilian] sco: Scots sh: srpskohrvatski / српскохрватски [Serbo-Croatian] si: සිංහල [Sinhalese] simple: Simple English sk: slovenčina [Slovak] sl: slovenščina [Slovenian] sq: shqip [Albanian] sr: српски / srpski [Serbian] su: Basa Sunda [Sundanese] sv: svenska [Swedish] sw: Kiswahili [Swahili] ta: தமிழ் [Tamil] te: తెలుగు [Telugu] tg: тоҷикӣ [Tajik] th: ไทย [Thai] tl: Tagalog tr: Türkçe [Turkish] tt: татарча/tatarça [Tatar] uk: українська [Ukrainian] ur: اردو [Urdu] uz: oʻzbekcha/ўзбекча [Uzbek] vec: vèneto [Venetian] vi: Tiếng Việt [Vietnamese] vo: Volapük wa: walon [Walloon] war: Winaray [Waray] yi: ייִדיש [Yiddish] yo: Yorùbá [Yoruba] zh: 中文 [Chinese] zh-min-nan: Bân-lâm-gú [Min Nan] zh-yue: 粵語 [Cantonese]

jump to random article

Longer titles found: Biconvex optimization (view)

searching for Convex optimization 111 found (332 total)

alternate case: convex optimization

BARON (262 words) [view diff] exact match in snippet view article find links to article

BARON is a computational system for solving non-convex optimization problems to global optimality. Purely continuous, purely integer, and mixed-integer

learning. He has authored a book, entitled Introduction to Online Convex Optimization. Hazan is the co-founder of In8 Inc., which was acquired by Google

2001 monograph A Mathematical View of Interior-point Methods in Convex Optimization is intended to present a general theory of interior-point methods

Norman Zadeh (son of Lotfi A. Zadeh), and has entered the folklore of convex optimization since then. Zadeh offered a reward of $1,000 to anyone who can show

"Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization". IEEE Transactions on Information Theory. 58 (5): 3235–3249. arXiv:1009

Convex Optimization Group". Retrieved 2020-03-12. "Financial signal processing libraries". GitHub. Retrieved 2020-03-12. "Stanford University Convex Optimization

holds 45 patents. He is the author of the edited volume: Handbook of Convex Optimization Methods in Imaging Science. Monga received the US National Science

Electrical and Electronics Engineers (IEEE) for his contributions to convex optimization in control systems. Balakrishnan was born and raised in India. His

the Columbia University faculty team to teach graduate courses in convex optimization and digital signal processing. He has won numerous prestigious awards

understanding of the power and limitations of convex optimization. His thesis work studied convex optimization in the context of questions related to statistical

understanding of the power and limitations of convex optimization. His thesis work studied convex optimization in the context of questions related to statistical

bandit convex optimization”, 2015; arXiv:1507.06580. Sébastien Bubeck, Ronen Eldan, Yin Tat Lee: “Kernel-based methods for bandit convex optimization”, 2016;

at Carnegie Mellon University. Her research involves studying non-convex optimization and compressed sensing algorithms used in machine learning and statistical

Computational Geometry". CRC Press LLC. Retrieved 24 July 2022. S., Boyd. "Convex Optimization". Cambridge University Press. Retrieved 14 March 2022. Jean-Luc,

be optimal to do so. Under certain conditions, as for example in convex optimization, if a constraint is non-binding, the optimization problem would have

Design", vol 6:1, 58-73 A. Ben-Tal and Arkadi Nemirovski, "Robust Convex Optimization", vol 23:4, 769-805 M. R. Garey, D. S. Johnson, and Ravi Sethi, "The

{\displaystyle f} . Nemirovsky and Ben-Tal (2023). "Optimization III: Convex Optimization" (PDF). Arkadi Nemirovsky (2004). "Interior point polynomial time

x):f_{i}(\Delta ,x)\leq 0,0\leq i\leq k,\Delta \geq xx^{T}\right\}.} This last convex optimization problem is known as the relaxed Chebyshev center (RCC). The RCC has

(PDF) on 2019-08-10. Boyd, Stephen P.; Vandenberghe, Lieven (2004). Convex Optimization (PDF). Cambridge University Press. ISBN 978-0-521-83378-3. Loucks

1999, pp. 215–222. Boyd, Stephen P.; Vandenberghe, Lieven (2004). Convex Optimization (pdf). Cambridge University Press. pp. 51–53. ISBN 978-0-521-83378-3

barycentric coordinates. Boyd, Stephen P.; Vandenberghe, Lieven (2004). Convex Optimization (PDF). Cambridge University Press. ISBN 978-0-521-83378-3. Retrieved

\over {{\bf {1}}^{T}u}}} Following these substitutions, the non-convex optimization problem is transformed into an instance of linear-fractional programming

Volume 49, 2007, Pages 371–418. Stephen Boyd and Lieven Vandenberghe Convex Optimization, Cambridge University Press, 2004, p.655. Linear matrix inequality

INFORMS Computing Society. Ben-Tal, A.; Nemirovski, A. (1998). "Robust Convex Optimization". Mathematics of Operations Research. 23 (4): 769–805. CiteSeerX 10

capacity of multimode optical communication systems. His work combined convex optimization, machine learning, adaptive optics and spatial light modulators.

Retrieved 2024-04-13. Yurii Nesterov (2004). Introductory Lectures on Convex Optimization: A Basic Course. Springer Science & Business Media. pp. 14–. ISBN 978-1-4020-7553-7

December 19, 2016, Author: Lars Blackmore. CVXGEN: Code Generation for Convex Optimization, cvxgen.com, December 4, 2013. Dong, Jielin, ed. (2007). Network

account some measure of quality of service. Using connections to convex optimization theory and stochastic approximations, he developed online opportunistic

descriptions have mainly been focusing on establishing methods based on convex optimization. Whereas parametric uncertainty descriptions are often natural candidates

ISBN 978-0-471-18117-0. Boyd, Stephen P.; Vandenberghe, Lieven (2004). Convex Optimization (pdf). Cambridge University Press. pp. 50–51. ISBN 978-0-521-83378-3

the ellipsoid method and its application in the combinatorial and convex optimization gained worldwide recognition. In recent years Martin Grötschel has

Proprietary Constrained nonlinear optimization, interior point methods, convex optimization and integer programming-as well as original symbolic methods integrated

inequality. ◼ {\displaystyle \blacksquare } Boyd, Stephen; Vandenberghe, Lieven (2004). Convex Optimization (PDF). Cambridge University Press. Minimax theorem

decision processes. His seminal body of work on lower bounds in convex optimization, leading to a sub-exponential lower bound for Zadeh's rule, was awarded

computational study of the homogeneous algorithm for large-scale convex optimization. Computational Optimization and Applications, 10:243–269, 1998 E

2011, pp. 225–273. Boyd, Stephen P.; Vandenberghe, Lieven (2004). Convex Optimization (pdf). Cambridge University Press. pp. 51–53. ISBN 9780521833783

735-738, DOI: 10.1002/PAMM.201510351 Stephen Boyd, Lieven Vandenbergh: Convex Optimization, Cambridge University Press, 2004, ISBN 9780521833783, pp. 337–337

Bandlimited Systems (2015) and co-author of Compressed Sensing (2012) and Convex Optimization Methods in Signal Processing and Communications (2010), all published

ISBN 0-471-22370-0. Stephen P Boyd; Lieven Vandenberghe (2004). Convex optimization. Cambridge University Press. ISBN 0-521-83378-7. Harvir Singh Kasana;

functions). The 2-norm and ∞-norm are strictly convex, and thus (by convex optimization) the minimizer is unique (if it exists), and exists for bounded distributions

ISBN 978-1-107-01322-3. Daniel P. Palomar; Yonina C. Eldar (2010). Convex Optimization in Signal Processing and Communications. Cambridge University Press

function, thus it does not fit into the AdaBoost framework. The non-convex optimization provides a method to avoid overfitting noisy data sets. However,

methods for large-scale linear problems, variational inequalities, and convex optimization | WorldCat.org". search.worldcat.org. Retrieved 2024-04-29. "From

Archived from the original on 2010-04-01. Taylor, Joshua Adam (2015). Convex Optimization of Power Systems. Cambridge University Press. ISBN 9781107076877

Michael (June 2023). "Bregman dynamics, contact transformations and convex optimization". Information Geometry. 6 (1): 355–377. arXiv:1912.02928. doi:10

2006, pp. 467–480 Nemirovsky and Ben-Tal (2023). "Optimization III: Convex Optimization" (PDF). Murty, K. G. (1988). Linear complementarity, linear and nonlinear

Combettes, Patrick L. (July 2018). "Monotone operator theory in convex optimization". Mathematical Programming. B170: 177–206. arXiv:1802.02694.

Vandenberghe, Lieven (2004). "Log-concave and log-convex functions". Convex Optimization. Cambridge University Press. pp. 104–108. ISBN 0-521-83378-7. Grechuk

Batch Normalization: The power of length-direction decoupling in non-convex optimization". arXiv:1805.10694 [stat.ML]. Santurkar, Shibani; Tsipras, Dimitris;

S2CID 8946639. Aharon Ben-Tal & Arkadi Nemirovski (1998). "Robust convex optimization". Mathematics of Operations Research. 23 (4): 769–805. CiteSeerX 10

Cutting Plane Method and its Implications for Combinatorial and Convex Optimization" 2014 Aaron Sidford (MIT) Yin Tat Lee (MIT) "Path-Finding Methods

arXiv:1609.04747 [cs.LG]. Nesterov, Y. (2004). Introductory Lectures on Convex Optimization: A Basic Course. Boston: Kluwer. p. 25. ISBN 1-4020-7553-7. Dixon

Vapnik–Chervonenkis dimension Boyd, Stephen; Vandenberghe, Lieven (2004-03-08). Convex Optimization. Cambridge University Press. doi:10.1017/cbo9780511804441. ISBN 978-0-521-83378-3

"Advanced vector math". Boyd, Stephen P.; Vandenberghe, Lieven (2004). Convex Optimization (PDF). Cambridge University Press. ISBN 978-0-521-83378-3. Golshtein

3800090303. MR 0152370. Boyd, Stephen P.; Vandenberghe, Lieven (2004). Convex Optimization (PDF). Cambridge University Press. p. 151. ISBN 978-0-521-83378-3

Component Analysis: Exact Recovery of Corrupted Low-Rank Matrices by Convex Optimization". Neural Information Processing Systems, NIPS 2009. S. Becker; E

optimal substructure Ellipsoid method: is an algorithm for solving convex optimization problems Evolutionary computation: optimization inspired by biological

Award. Zhu, Minghui; Martínez, Sonia (January 2012), "On distributed convex optimization under inequality and equality constraints", IEEE Transactions on

However, note that in the authors gave an example of stochastic convex optimization for General Setting of Learning where learnability is not equivalent

retrieval, error reduction algorithm, and Fienup variants: a view from convex optimization". Journal of the Optical Society of America A. 19 (7): 1334–45. Bibcode:2002JOSAA

retrieval, error reduction algorithm, and Fienup variants: a view from convex optimization". Journal of the Optical Society of America A. 19 (7): 1334–45. Bibcode:2002JOSAA

relative to the same axis. The Center-of-gravity method is a method for convex optimization, which uses the center-of-gravity of the feasible region. Physics

ISBN 978-0-471-98635-5. Boyd, Stephen; Vandenberghe, Lieven (2004). Convex Optimization. Exercise 2.9: Cambridge University Press. p. 60.{{cite book}}: CS1

Ellipsoidal parameters sets were used by Campi (2009), which yield a convex optimization program to train the IPM. Crespo (2016) proposed the use of a hyperrectangular

This allows for the underlying inference to be solved quickly as a convex optimization problem. This is useful in problems such as collective classification

ISBN 9783540326960. Boyd, Stephen; Vandenberghe, Lieven (2004). Convex Optimization. Cambridge University Press. ISBN 9780521833783. Diestel, Joe (1984)

"Minimizing the Peak-to-Average Power Ratio of OFDM Signals Using Convex Optimization," IEEE Trans. on Signal Processing, Vol. 54, No. 8, pp. 3099–3110

01.002. S2CID 222272289. Boyd, S. and Vandenberghe, L. (2004), "Convex Optimization", Cambridge University Press (Appendix A.5.5) von Mises, Richard

"Multiple Beam Synthesis of Passively Cooled 5G Planar Arrays Using Convex Optimization," IEEE Transactions on Antennas and Propagation, 2020. "Synthesis

Lieven (University of California Vandenberghe, Los (2004-03-08). Convex Optimization (PDF). Cambridge University Press. ISBN 9780521833783.{{cite book}}:

formulation of the linear discrete Coulomb friction problem via convex optimization". Journal of Applied Mathematics and Mechanics. 91 (2): 155–175.

optimization techniques, e.g., based on incremental approaches and convex optimization, random swaps (i.e., iterated local search), variable neighborhood

unique solution which can be determined with provably convergent convex optimization methods . Alternatively, the solution can be determined numerically

Historical Perspective" (PDF). Columbia University. Boyd, Stephen (2004). Convex Optimization. Cambridge University Press. ISBN 978-0521833783. Roe, John (1993)

Emmanuel J.; Recht, Benjamin (2009). "Exact Matrix Completion via Convex Optimization". Foundations of Computational Mathematics. 9 (6): 717–772. doi:10

and protease amino acid sequences using sparse models created by convex optimization". Bioinformatics. 22 (5): 541–549. doi:10.1093/bioinformatics/btk011

"Simplex". MathWorld. Boyd, Stephen; Vandenberghe, Lieven (2004). Convex Optimization. Cambridge University Press. ISBN 978-1-107-39400-1. As PDF Look

Candès, Emmanuel J.; Recht, Benjamin Exact matrix completion via convex optimization. Found. Comput. Math. 9 (2009), no. 6, 717–772. Recht, Benjamin A

_{j=1}^{J}\psi _{j}\nu _{j}\right\}} which is a finite-dimensional convex optimization problem that can be solved by standard techniques, such as gradient

Lindquist, From finite covariance windows to modeling filters: A convex optimization approach, SIAM Review 43 (December 2001), 645–675. C. I. Byrnes,

His early contributions in this area demonstrated that, within a convex optimization framework, bounds to the probability of invalidating a decision can

Stanford University American Works on engineering applications of convex optimization. Winner of John R. Ragazzini Award in control systems. 1958 IEEE

performs multidimensional scaling in local regions, and then uses convex optimization to fit all the pieces together. Nonlinear PCA (NLPCA) uses backpropagation

Robert (2009). "Cones and interior-point algorithms for structured convex optimization involving powers andexponentials". S2CID 118322815. {{cite web}}:

March 2014. Harremoës, Peter (2017). "Divergence and Sufficiency for Convex Optimization". Entropy. 19 (5): 206. arXiv:1701.01010. Bibcode:2017Entrp..19.

norm. The closest Matrix can be computed by solving a quadratic-convex optimization problem. For many systems of physical and chemical kinetics, detailed

authors list (link) Boyd, Stephen; Vandenberghe, Lieven (2004-03-08). Convex Optimization. Cambridge University Press. doi:10.1017/cbo9780511804441. ISBN 978-0-521-83378-3

DMD mode selection problem that can be solved efficiently using convex optimization techniques. Multi-Resolution DMD: Multi-Resolution DMD (mrDMD) is

interpreter Marguerite Frank (born 1927), French-American pioneer in convex optimization theory and mathematical programming Hélène Frankowska, Polish-French

shortfall, in its standard form, is known to lead to a generally non-convex optimization problem. However, it is possible to transform the problem into a

upper bound on the positioning error due to image noise using a convex- optimization technique. provides a discussion on stability analysis with respect

arXiv:1902.09004, 2019. Nemirovsky and Ben-Tal (2023). "Optimization III: Convex Optimization" (PDF). Pennington, Fabian Pedregosa, Courtney Paquette, Tom Trogdon

"Identifying and attacking the saddle point problem in high-dimensional non-convex optimization". NeurIPS. 14: 2933–2941. arXiv:1406.2572. Lange, K. (2013). Optimization

with goods, when the resources are bads the CE does not solve any convex optimization problem even with linear utilities. CE allocations correspond to

21398. ISSN 0010-3640. S2CID 3175317. P., Boyd, Stephen (2011). Convex optimization. Cambridge Univ. Pr. ISBN 978-0-521-83378-3. OCLC 767754283.{{cite

contributions to compressed sampling, generalized sampling, and convex optimization Erwin Carl Gangl For development of digital avionics intra-communication

Identifying and attacking the saddle point problem in high-dimensional non-convex optimization (PDF). Curran Associates, Inc. pp. 2933–2941. Saxe, Andrew M.; McClelland

while the weighted max-min fairness utility results in a quasi-convex optimization problem with only a polynomial scaling with the number of users.

contributions to the design and analysis of control systems using convex optimization based CAD tools" 1999 Howard Chizeck "For contributions to the use

(2021). "Constant Function Market Makers: Multi-Asset Trades via Convex Optimization". arXiv:2107.12484 [math.OC]. Angeris, Guillermo; Evans, Alex; Chitra

accounting into linear algebra and uses the engineering algorithm of convex optimization to solve for partner tax allocations. The book The Tao of Partnership

Associates, Inc.: 965–979. Boyd, Stephen P.; Vandenberghe, Lieven (2023). Convex optimization (Version 29 ed.). Cambridge New York Melbourne New Delhi Singapore:

A.; Protasi, M. (1980), "Structure preserving reductions among convex optimization problems", Journal of Computer and System Sciences, 21 (1): 136–153

bounded creatures. Applications of Grunbaum's theorem also appear in convex optimization, specifically in analyzing the converge of the center of gravity

S2CID 220935477. Boyd, Stephen P.; Vandenberghe, Lieven (2004). Convex Optimization (PDF). Cambridge University Press. ISBN 978-0-521-83378-3. Retrieved

P ∗ {\displaystyle P^{*}} can be computed by solving a quadratic-convex optimization problem. For example, consider the following Markov chain: This Markov

Moshirvaziri K. (2011). A deep cutting plane technique for reverse convex optimization. IEEE Transactions, Systems, Man, Cybernetics B, Volume 41(4), 2011

analysis, joint fluid analysis and Lagrange multiplier analysis, convex optimization, and stochastic gradients. These approaches do not provide the O(1/V)

contributions to the design and analysis of control systems using convex optimization based CAD tools. 1999 Oren Kesler For contributions to the theory

Córcoles, Juan; Zastrow, Earl; Kuster, Niels (8 September 2015). "Convex optimization of MRI exposure for mitigation of RF-heating from active medical

contributions to compressed sampling, generalized sampling, and convex optimization 2013 Ying-dar Lin For contributions to multi-hop cellular communications