Gaining traction: on the convergence of an inner approximation scheme for probability maximization (Q2045616): Difference between revisions

@@ Property / cites work @@
+Q5629405
@@ Property / cites work: Q5629405 / rank @@
+Normal rank
@@ Property / cites work @@
+Level bundle methods for oracles with on-demand accuracy
+Normal rank
@@ Property / cites work @@
+A Practical Geometrically Convergent Cutting Plane Algorithm
+Normal rank
@@ Property / cites work @@
+Regularization methods for optimization problems with probabilistic constraints
+Normal rank
@@ Property / cites work @@
+Concavity and efficient points of discrete distributions in probabilistic programming.
+Normal rank
@@ Property / cites work @@
+Dual methods for probabilistic optimization problems.
+Normal rank
@@ Property / cites work @@
+Generalized Bundle Methods
@@ Property / cites work: Generalized Bundle Methods / rank @@
+Normal rank
@@ Property / cites work @@
+Conjugation and second-order properties of convex functions
+Normal rank
@@ Property / cites work @@
+Subdifferential characterization of probability functions under Gaussian distribution
+Normal rank
@@ Property / cites work @@
+Linear and nonlinear programming.
@@ Property / cites work: Linear and nonlinear programming. / rank @@
+Normal rank
@@ Property / cites work @@
+Q5723445
@@ Property / cites work: Q5723445 / rank @@
+Normal rank
@@ Property / cites work @@
+Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
+Normal rank
@@ Property / cites work @@
+Q3840335
@@ Property / cites work: Q3840335 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4235027
@@ Property / cites work: Q4235027 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3376534
@@ Property / cites work: Q3376534 / rank @@
+Normal rank
@@ Property / cites work @@
+Smoothed analysis of algorithms
@@ Property / cites work: Smoothed analysis of algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic optimization via approximate \(p\)-efficient points and bundle methods
+Normal rank