Find link

Convex optimization not in Hybrid input-output algorithm

language:

jump to random article

Find link is a tool written by Edward Betts.

Longer titles found: Biconvex optimization (view)

searching for Convex optimization 112 found (333 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
Elad Hazan (748 words) [view diff] case mismatch in snippet view article find links to article
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
Bounding sphere (1,736 words) [view diff] exact match in snippet view article find links to article
sources such as Boyd & Vandenberghe's convex optimization book, and is widely supported in convex optimization software such as CVX, CVXPY, and MOSEK
James Renegar (1,009 words) [view diff] case mismatch in snippet view article find links to article
2001 monograph A Mathematical View of Interior-point Methods in Convex Optimization is intended to present a general theory of interior-point methods
Zadeh's rule (515 words) [view diff] exact match in snippet view article find links to article
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
Oracle complexity (optimization) (1,196 words) [view diff] case mismatch in snippet view article
"Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization". IEEE Transactions on Information Theory. 58 (5): 3235–3249. arXiv:1009
Venkataramanan Balakrishnan (546 words) [view diff] exact match in snippet view article find links to article
Electrical and Electronics Engineers (IEEE) for his contributions to convex optimization in control systems. Balakrishnan was born and raised in India. His
Financial signal processing (816 words) [view diff] case mismatch in snippet view article find links to article
Convex Optimization Group". Retrieved 2020-03-12. "Financial signal processing libraries". GitHub. Retrieved 2020-03-12. "Stanford University Convex Optimization
Vishal Monga (773 words) [view diff] case mismatch in snippet view article find links to article
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
Mehdi Ashraphijuo (634 words) [view diff] exact match in snippet view article find links to article
the Columbia University faculty team to teach graduate courses in convex optimization and digital signal processing. He has won numerous prestigious awards
Veronika Ročková (473 words) [view diff] exact match in snippet view article find links to article
methods including variable selection, high-dimensional inference, non-convex optimization, likelihood-free inference, and the spike-and-slab LASSO, and also
Venkat Chandrasekaran (185 words) [view diff] exact match in snippet view article find links to article
understanding of the power and limitations of convex optimization. His thesis work studied convex optimization in the context of questions related to statistical
Ronen Eldan (441 words) [view diff] exact match in snippet view article find links to article
bandit convex optimization”, 2015; arXiv:1507.06580. Sébastien Bubeck, Ronen Eldan, Yin Tat Lee: “Kernel-based methods for bandit convex optimization”, 2016;
Yuejie Chi (404 words) [view diff] exact match in snippet view article find links to article
at Carnegie Mellon University. Her research involves studying non-convex optimization and compressed sensing algorithms used in machine learning and statistical
Slab (geometry) (242 words) [view diff] case mismatch in snippet view article
Computational Geometry". CRC Press LLC. Retrieved 24 July 2022. S., Boyd. "Convex Optimization". Cambridge University Press. Retrieved 14 March 2022. Jean-Luc,
Constraint (mathematics) (815 words) [view diff] exact match in snippet view article
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
Mathematics of Operations Research (252 words) [view diff] case mismatch in snippet view article find links to article
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
Self-concordant function (4,403 words) [view diff] case mismatch in snippet view article find links to article
{\displaystyle f} . Nemirovsky and Ben-Tal (2023). "Optimization III: Convex Optimization" (PDF). Arkadi Nemirovsky (2004). "Interior point polynomial time
Chebyshev center (1,507 words) [view diff] exact match in snippet view article find links to article
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
Hydrological optimization (794 words) [view diff] case mismatch in snippet view article find links to article
(PDF) on 2019-08-10. Boyd, Stephen P.; Vandenberghe, Lieven (2004). Convex Optimization (PDF). Cambridge University Press. ISBN 978-0-521-83378-3. Loucks
Slack variable (452 words) [view diff] case mismatch in snippet view article find links to article
barycentric coordinates. Boyd, Stephen P.; Vandenberghe, Lieven (2004). Convex Optimization (PDF). Cambridge University Press. ISBN 978-0-521-83378-3. Retrieved
Dual cone and polar cone (952 words) [view diff] case mismatch in snippet view article find links to article
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
S-procedure (294 words) [view diff] case mismatch in snippet view article find links to article
Volume 49, 2007, Pages 371–418. Stephen Boyd and Lieven Vandenberghe Convex Optimization, Cambridge University Press, 2004, p.655. Linear matrix inequality
Robust optimization (3,410 words) [view diff] case mismatch in snippet view article find links to article
INFORMS Computing Society. Ben-Tal, A.; Nemirovski, A. (1998). "Robust Convex Optimization". Mathematics of Operations Research. 23 (4): 769–805. CiteSeerX 10
Laurence Wolsey (601 words) [view diff] case mismatch in snippet view article find links to article
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
Omega ratio (862 words) [view diff] exact match in snippet view article find links to article
\over {{\bf {1}}^{T}u}}} Following these substitutions, the non-convex optimization problem is transformed into an instance of linear-fractional programming
Ness B. Shroff (1,096 words) [view diff] exact match in snippet view article find links to article
account some measure of quality of service. Using connections to convex optimization theory and stochastic approximations, he developed online opportunistic
Rahul Panicker (919 words) [view diff] exact match in snippet view article find links to article
capacity of multimode optical communication systems. His work combined convex optimization, machine learning, adaptive optics and spatial light modulators.
Jakob Stoustrup (1,528 words) [view diff] exact match in snippet view article find links to article
descriptions have mainly been focusing on establishing methods based on convex optimization. Whereas parametric uncertainty descriptions are often natural candidates
Programming language generations (959 words) [view diff] case mismatch in snippet view article find links to article
December 19, 2016, Author: Lars Blackmore. CVXGEN: Code Generation for Convex Optimization, cvxgen.com, December 4, 2013. Dong, Jielin, ed. (2007). Network
Supporting hyperplane (753 words) [view diff] case mismatch in snippet view article find links to article
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
Oliver Friedmann (213 words) [view diff] exact match in snippet view article find links to article
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
Comparison of optimization software (371 words) [view diff] exact match in snippet view article find links to article
Proprietary Constrained nonlinear optimization, interior point methods, convex optimization and integer programming-as well as original symbolic methods integrated
Max–min inequality (507 words) [view diff] case mismatch in snippet view article find links to article
inequality. ◼ {\displaystyle \blacksquare } Boyd, Stephen; Vandenberghe, Lieven (2004). Convex Optimization (PDF). Cambridge University Press. Minimax theorem
Max–min inequality (507 words) [view diff] case mismatch in snippet view article find links to article
inequality. ◼ {\displaystyle \blacksquare } Boyd, Stephen; Vandenberghe, Lieven (2004). Convex Optimization (PDF). Cambridge University Press. Minimax theorem
MOSEK (376 words) [view diff] exact match in snippet view article find links to article
computational study of the homogeneous algorithm for large-scale convex optimization. Computational Optimization and Applications, 10:243–269, 1998 E
Martin Grötschel (998 words) [view diff] exact match in snippet view article find links to article
the ellipsoid method and its application in the combinatorial and convex optimization gained worldwide recognition. In recent years Martin Grötschel has
Basis pursuit (559 words) [view diff] case mismatch in snippet view article find links to article
735-738, DOI: 10.1002/PAMM.201510351 Stephen Boyd, Lieven Vandenbergh: Convex Optimization, Cambridge University Press, 2004, ISBN 9780521833783, pp. 337–337
Bipolar theorem (829 words) [view diff] case mismatch in snippet view article find links to article
2011, pp. 225–273. Boyd, Stephen P.; Vandenberghe, Lieven (2004). Convex Optimization (pdf). Cambridge University Press. pp. 51–53. ISBN 9780521833783
Posynomial (360 words) [view diff] exact match in snippet view article find links to article
ISBN 0-471-22370-0. Stephen P Boyd; Lieven Vandenberghe (2004). Convex optimization. Cambridge University Press. ISBN 0-521-83378-7. Harvir Singh Kasana;
Yonina Eldar (1,255 words) [view diff] case mismatch in snippet view article find links to article
Bandlimited Systems (2015) and co-author of Compressed Sensing (2012) and Convex Optimization Methods in Signal Processing and Communications (2010), all published
Mengdi Wang (632 words) [view diff] exact match in snippet view article find links to article
methods for large-scale linear problems, variational inequalities, and convex optimization | WorldCat.org". search.worldcat.org. Retrieved 2024-04-29. "From
Central tendency (1,720 words) [view diff] exact match in snippet view article find links to article
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
BrownBoost (1,436 words) [view diff] exact match in snippet view article find links to article
function, thus it does not fit into the AdaBoost framework. The non-convex optimization provides a method to avoid overfitting noisy data sets. However,
Signal processing (2,270 words) [view diff] case mismatch in snippet view article find links to article
ISBN 978-1-107-01322-3. Daniel P. Palomar; Yonina C. Eldar (2010). Convex Optimization in Signal Processing and Communications. Cambridge University Press
Bregman Lagrangian (214 words) [view diff] exact match in snippet view article find links to article
Michael (June 2023). "Bregman dynamics, contact transformations and convex optimization". Information Geometry. 6 (1): 355–377. arXiv:1912.02928. doi:10
Linear complementarity problem (1,753 words) [view diff] case mismatch in snippet view article find links to article
Archived from the original on 2010-04-01. Taylor, Joshua Adam (2015). Convex Optimization of Power Systems. Cambridge University Press. ISBN 9781107076877
Active-set method (639 words) [view diff] case mismatch in snippet view article find links to article
2006, pp. 467–480 Nemirovsky and Ben-Tal (2023). "Optimization III: Convex Optimization" (PDF). Murty, K. G. (1988). Linear complementarity, linear and nonlinear
Contraction mapping (1,120 words) [view diff] exact match in snippet view article find links to article
Combettes, Patrick L. (July 2018). "Monotone operator theory in convex optimization". Mathematical Programming. B170: 177–206. arXiv:1802.02694.
Logarithmically concave function (1,319 words) [view diff] case mismatch in snippet view article find links to article
Vandenberghe, Lieven (2004). "Log-concave and log-convex functions". Convex Optimization. Cambridge University Press. pp. 104–108. ISBN 0-521-83378-7. Grechuk
SAMPL (867 words) [view diff] exact match in snippet view article find links to article
S2CID 8946639. Aharon Ben-Tal & Arkadi Nemirovski (1998). "Robust convex optimization". Mathematics of Operations Research. 23 (4): 769–805. CiteSeerX 10
Batch normalization (5,892 words) [view diff] exact match in snippet view article find links to article
Batch Normalization: The power of length-direction decoupling in non-convex optimization". arXiv:1805.10694 [stat.ML]. Santurkar, Shibani; Tsipras, Dimitris;
Machtey Award (179 words) [view diff] case mismatch in snippet view article find links to article
Cutting Plane Method and its Implications for Combinatorial and Convex Optimization" 2014 Aaron Sidford (MIT) Yin Tat Lee (MIT) "Path-Finding Methods
Linear separability (1,625 words) [view diff] case mismatch in snippet view article find links to article
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
Hyperplane separation theorem (2,689 words) [view diff] case mismatch in snippet view article find links to article
"Advanced vector math". Boyd, Stephen P.; Vandenberghe, Lieven (2004). Convex Optimization (PDF). Cambridge University Press. ISBN 978-0-521-83378-3. Golshtein
Learning rate (1,108 words) [view diff] case mismatch in snippet view article find links to article
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
Linear-fractional programming (1,352 words) [view diff] case mismatch in snippet view article find links to article
3800090303. MR 0152370. Boyd, Stephen P.; Vandenberghe, Lieven (2004). Convex Optimization (PDF). Cambridge University Press. p. 151. ISBN 978-0-521-83378-3
Robust principal component analysis (1,765 words) [view diff] case mismatch in snippet view article find links to article
Component Analysis: Exact Recovery of Corrupted Low-Rank Matrices by Convex Optimization". Neural Information Processing Systems, NIPS 2009. S. Becker; E
Sonia Martínez Díaz (630 words) [view diff] exact match in snippet view article find links to article
Award. Zhu, Minghui; Martínez, Sonia (January 2012), "On distributed convex optimization under inequality and equality constraints", IEEE Transactions on
List of algorithms (7,951 words) [view diff] exact match in snippet view article find links to article
optimal substructure Ellipsoid method: is an algorithm for solving convex optimization problems Evolutionary computation: optimization inspired by biological
Learnable function class (1,338 words) [view diff] exact match in snippet view article find links to article
However, note that in the authors gave an example of stochastic convex optimization for General Setting of Learning where learnability is not equivalent
Center of mass (4,872 words) [view diff] exact match in snippet view article find links to article
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
Hybrid input-output algorithm (576 words) [view diff] exact match in snippet view article find links to article
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
Interval predictor model (1,585 words) [view diff] exact match in snippet view article find links to article
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
Probabilistic soft logic (2,120 words) [view diff] exact match in snippet view article find links to article
This allows for the underlying inference to be solved quickly as a convex optimization problem. This is useful in problems such as collective classification
Dual norm (2,943 words) [view diff] case mismatch in snippet view article find links to article
ISBN 9783540326960. Boyd, Stephen; Vandenberghe, Lieven (2004). Convex Optimization. Cambridge University Press. ISBN 9780521833783. Diestel, Joe (1984)
Voronoi diagram (5,504 words) [view diff] case mismatch in snippet view article find links to article
ISBN 978-0-471-98635-5. Boyd, Stephen; Vandenberghe, Lieven (2004). Convex Optimization. Exercise 2.9: Cambridge University Press. p. 60.{{cite book}}: CS1
Antoine Georges Roederer (590 words) [view diff] case mismatch in snippet view article find links to article
"Multiple Beam Synthesis of Passively Cooled 5G Planar Arrays Using Convex Optimization," IEEE Transactions on Antennas and Propagation, 2020. "Synthesis
Teresa Meng (1,316 words) [view diff] case mismatch in snippet view article find links to article
"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
Schur complement (2,910 words) [view diff] case mismatch in snippet view article find links to article
01.002. S2CID 222272289. Boyd, S. and Vandenberghe, L. (2004), "Convex Optimization", Cambridge University Press (Appendix A.5.5) von Mises, Richard
Design optimization (1,689 words) [view diff] case mismatch in snippet view article find links to article
Lieven (University of California Vandenberghe, Los (2004-03-08). Convex Optimization (PDF). Cambridge University Press. ISBN 9780521833783.{{cite book}}:
Anders Lindquist (1,125 words) [view diff] exact match in snippet view article find links to article
Lindquist, From finite covariance windows to modeling filters: A convex optimization approach, SIAM Review 43 (December 2001), 645–675. C. I. Byrnes,
Risk parity (4,003 words) [view diff] exact match in snippet view article find links to article
unique solution which can be determined with provably convergent convex optimization methods . Alternatively, the solution can be determined numerically
K-means clustering (7,770 words) [view diff] exact match in snippet view article find links to article
optimization techniques, e.g., based on incremental approaches and convex optimization, random swaps (i.e., iterated local search), variable neighborhood
Glossary of mathematical jargon (5,513 words) [view diff] case mismatch in snippet view article find links to article
Historical Perspective" (PDF). Columbia University. Boyd, Stephen (2004). Convex Optimization. Cambridge University Press. ISBN 978-0521833783. Roe, John (1993)
Occam's razor (10,904 words) [view diff] exact match in snippet view article find links to article
and protease amino acid sequences using sparse models created by convex optimization". Bioinformatics. 22 (5): 541–549. doi:10.1093/bioinformatics/btk011
Friction (8,432 words) [view diff] exact match in snippet view article find links to article
formulation of the linear discrete Coulomb friction problem via convex optimization". Journal of Applied Mathematics and Mechanics. 91 (2): 155–175.
Terence Tao (6,700 words) [view diff] exact match in snippet view article find links to article
Candès, Emmanuel J.; Recht, Benjamin Exact matrix completion via convex optimization. Found. Comput. Math. 9 (2009), no. 6, 717–772. Recht, Benjamin A
Matrix regularization (2,510 words) [view diff] case mismatch in snippet view article find links to article
Emmanuel J.; Recht, Benjamin (2009). "Exact Matrix Completion via Convex Optimization". Foundations of Computational Mathematics. 9 (6): 717–772. doi:10
Transportation theory (mathematics) (4,442 words) [view diff] exact match in snippet view article
_{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
Simplex (7,872 words) [view diff] case mismatch in snippet view article find links to article
"Simplex". MathWorld. Boyd, Stephen; Vandenberghe, Lieven (2004). Convex Optimization. Cambridge University Press. ISBN 978-1-107-39400-1. As PDF Look
Marco Claudio Campi (1,056 words) [view diff] exact match in snippet view article find links to article
His early contributions in this area demonstrated that, within a convex optimization framework, bounds to the probability of invalidating a decision can
List of people in systems and control (520 words) [view diff] exact match in snippet view article find links to article
Stanford University American Works on engineering applications of convex optimization. Winner of John R. Ragazzini Award in control systems. 1958 IEEE
Entropic value at risk (2,016 words) [view diff] exact match in snippet view article find links to article
Robert (2009). "Cones and interior-point algorithms for structured convex optimization involving powers andexponentials". S2CID 118322815. {{cite web}}:
Nonlinear dimensionality reduction (6,119 words) [view diff] exact match in snippet view article find links to article
performs multidimensional scaling in local regions, and then uses convex optimization to fit all the pieces together. Nonlinear PCA (NLPCA) uses backpropagation
Bregman divergence (4,475 words) [view diff] case mismatch in snippet view article find links to article
March 2014. Harremoës, Peter (2017). "Divergence and Sufficiency for Convex Optimization". Entropy. 19 (5): 206. arXiv:1701.01010. Bibcode:2017Entrp..19.
Dynamic mode decomposition (3,792 words) [view diff] exact match in snippet view article find links to article
DMD mode selection problem that can be solved efficiently using convex optimization techniques. Multi-Resolution DMD: Multi-Resolution DMD (mrDMD) is
Principal component analysis (14,851 words) [view diff] case mismatch in snippet view article find links to article
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
List of women in mathematics (23,412 words) [view diff] exact match in snippet view article find links to article
interpreter Marguerite Frank (born 1927), French-American pioneer in convex optimization theory and mathematical programming Hélène Frankowska, Polish-French
Expected shortfall (6,445 words) [view diff] exact match in snippet view article find links to article
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
Conjugate gradient method (8,421 words) [view diff] case mismatch in snippet view article find links to article
09004 , 2019. Nemirovsky and Ben-Tal (2023). "Optimization III: Convex Optimization" (PDF). Pennington, Fabian Pedregosa, Courtney Paquette, Tom Trogdon
Detailed balance (6,465 words) [view diff] exact match in snippet view article find links to article
norm. The closest Matrix can be computed by solving a quadratic-convex optimization problem. For many systems of physical and chemical kinetics, detailed
Visual servoing (4,026 words) [view diff] no match in snippet view article find links to article
upper bound on the positioning error due to image noise using a convex- optimization technique. provides a discussion on stability analysis with respect
Fisher market (2,899 words) [view diff] exact match in snippet view article find links to article
with goods, when the resources are bads the CE does not solve any convex optimization problem even with linear utilities. CE allocations correspond to
List of fellows of IEEE Aerospace and Electronic Systems Society (57 words) [view diff] exact match in snippet view article find links to article
contributions to compressed sampling, generalized sampling, and convex optimization Erwin Carl Gangl For development of digital avionics intra-communication
Backtracking line search (4,564 words) [view diff] exact match in snippet view article find links to article
"Identifying and attacking the saddle point problem in high-dimensional non-convex optimization". NeurIPS. 14: 2933–2941. arXiv:1406.2572. Lange, K. (2013). Optimization
Surya Ganguli (954 words) [view diff] exact match in snippet view article find links to article
Identifying and attacking the saddle point problem in high-dimensional non-convex optimization (PDF). Curran Associates, Inc. pp. 2933–2941. Saxe, Andrew M.; McClelland
Grothendieck inequality (4,840 words) [view diff] exact match in snippet view article find links to article
21398. ISSN 0010-3640. S2CID 3175317. P., Boyd, Stephen (2011). Convex optimization. Cambridge Univ. Pr. ISBN 978-0-521-83378-3. OCLC 767754283.{{cite
List of fellows of IEEE Control Systems Society (57 words) [view diff] exact match in snippet view article find links to article
contributions to the design and analysis of control systems using convex optimization based CAD tools" 1999 Howard Chizeck "For contributions to the use
Constant function market maker (2,875 words) [view diff] case mismatch in snippet view article find links to article
(2021). "Constant Function Market Makers: Multi-Asset Trades via Convex Optimization". arXiv:2107.12484 [math.OC]. Angeris, Guillermo; Evans, Alex; Chitra
Partnership taxation in the United States (4,094 words) [view diff] exact match in snippet view article find links to article
accounting into linear algebra and uses the engineering algorithm of convex optimization to solve for partner tax allocations. The book The Tao of Partnership
Multi-objective optimization (10,097 words) [view diff] exact match in snippet view article find links to article
while the weighted max-min fairness utility results in a quasi-convex optimization problem with only a polynomial scaling with the number of users.
AI alignment (13,069 words) [view diff] exact match in snippet view article find links to article
Associates, Inc.: 965–979. Boyd, Stephen P.; Vandenberghe, Lieven (2023). Convex optimization (Version 29 ed.). Cambridge New York Melbourne New Delhi Singapore:
Feedback arc set (6,116 words) [view diff] exact match in snippet view article find links to article
A.; Protasi, M. (1980), "Structure preserving reductions among convex optimization problems", Journal of Computer and System Sciences, 21 (1): 136–153
Brunn–Minkowski theorem (2,993 words) [view diff] exact match in snippet view article find links to article
bounded creatures. Applications of Grunbaum's theorem also appear in convex optimization, specifically in analyzing the converge of the center of gravity
Variational Bayesian methods (11,243 words) [view diff] case mismatch in snippet view article find links to article
S2CID 220935477. Boyd, Stephen P.; Vandenberghe, Lieven (2004). Convex Optimization (PDF). Cambridge University Press. ISBN 978-0-521-83378-3. Retrieved
Discrete-time Markov chain (4,252 words) [view diff] exact match in snippet view article find links to article
P ∗ {\displaystyle P^{*}} can be computed by solving a quadratic-convex optimization problem. For example, consider the following Markov chain: This Markov
Mahyar Amouzegar (1,656 words) [view diff] exact match in snippet view article find links to article
Moshirvaziri K. (2011). A deep cutting plane technique for reverse convex optimization. IEEE Transactions, Systems, Man, Cybernetics B, Volume 41(4), 2011
Backpressure routing (7,659 words) [view diff] exact match in snippet view article find links to article
analysis, joint fluid analysis and Lagrange multiplier analysis, convex optimization, and stochastic gradients. These approaches do not provide the O(1/V)
List of fellows of IEEE Circuits and Systems Society (78 words) [view diff] exact match in snippet view article find links to article
contributions to the design and analysis of control systems using convex optimization based CAD tools. 1999 Oren Kesler For contributions to the theory
Foundation for Research on Information Technologies in Society (3,672 words) [view diff] exact match in snippet view article find links to article
Córcoles, Juan; Zastrow, Earl; Kuster, Niels (8 September 2015). "Convex optimization of MRI exposure for mitigation of RF-heating from active medical
List of fellows of IEEE Communications Society (86 words) [view diff] exact match in snippet view article find links to article
contributions to compressed sampling, generalized sampling, and convex optimization 2013 Ying-dar Lin For contributions to multi-hop cellular communications