47 results on '"Anjos, Miguel F."'
Search Results
2. Balancing supply and demand in the presence of renewable generation via demand response for electric water heaters
3. Computational study of valid inequalities for the maximum k-cut problem
4. Paths, pivots, and practice: the power of optimization
5. Global Approaches for Facility Layout and VLSI Floorplanning
6. Introduction to Semidefinite, Conic and Polynomial Optimization
7. A Primal-Dual Slack Approach to Warmstarting Interior-Point Methods for Linear Programming
8. Strengthened Semidefinite Programming Relaxations for the Max-Cut Problem
9. Announcement: Howard Rosenbrock Prize 2016
10. Announcement: Inaugural Howard Rosenbrock Prize
11. Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems
12. Announcement: Howard Rosenbrock Prize 2015
13. A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem
14. A nonlinear optimization methodology for VLSI fixed-outline floorplanning
15. Introduction to Semidefinite, Conic and Polynomial Optimization
16. Global Approaches for Facility Layout and VLSI Floorplanning
17. Editorial
18. Editorial
19. Sparse PCA: Convex Relaxations, Algorithms and Applications
20. Latest Developments in the SDPA Family for Solving Large-Scale SDPs
21. On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
22. Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
23. The State-of-the-Art in Conic Optimization Software
24. Computational Approaches to Max-Cut
25. Euclidean Distance Matrices and Applications
26. SDP Relaxations for Some Combinatorial Optimization Problems
27. PENNON: Software for Linear and Nonlinear Matrix Inequalities
28. Convex Relaxations and Integrality Gaps
29. SDP Relaxations for Non-Commutative Polynomial Optimization
30. Semidefinite Programming and Constraint Programming
31. Elementary Optimality Conditions for Nonlinear SDPs
32. Projection Methods in Conic Optimization
33. Block Coordinate Descent Methods for Semidefinite Programming
34. Relaxations of Combinatorial Problems Via Association Schemes
35. Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems
36. Self-Regular Interior-Point Methods for Semidefinite Optimization
37. Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects
38. Invariant Semidefinite Programs
39. Convex Hulls of Algebraic Sets
40. Copositive Programming
41. An Introduction to Formally Real Jordan Algebras and Their Applications in Optimization
42. A 'Joint+Marginal' Approach in Optimization
43. Semidefinite Representation of Convex Sets and Convex Hulls
44. Algebraic Degree in Semidefinite and Polynomial Optimization
45. The Approach of Moments for Polynomial Equations
46. Positivity and Optimization: Beyond Polynomials
47. Convexity and Semidefinite Programming in Dimension-Free Matrix Unknowns
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.