Pages that link to "Item:Q163006"
From MaRDI portal
The following pages link to Mathematical Programming. Series A. Series B (Q163006):
Displaying 50 items.
- Linear passive systems and maximal monotone mappings (Q301654) (← links)
- Simple examples for the failure of Newton's method with line search for strictly convex minimization (Q304219) (← links)
- On Lipschitz optimization based on gray-box piecewise linearization (Q304252) (← links)
- The impact of the existence of multiple adjustable robust solutions (Q344967) (← links)
- Analysis of direct searches for discontinuous functions (Q431012) (← links)
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization (Q463723) (← links)
- A simple randomised algorithm for convex optimisation (Q463726) (← links)
- Continuous location under the effect of `refraction' (Q507312) (← links)
- On reduced semidefinite programs for second order moment bounds with applications (Q507337) (← links)
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results (Q535013) (← links)
- On the structure of the solution set for the single facility location problem with average distances (Q543416) (← links)
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints (Q623367) (← links)
- On verifiable sufficient conditions for sparse signal recovery via \(\ell_{1}\) minimization (Q633105) (← links)
- Pegasos: primal estimated sub-gradient solver for SVM (Q633112) (← links)
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation (Q644906) (← links)
- On the finite convergence of interior-point algorithms for linear programming (Q687096) (← links)
- Lower subdifferentiability of quadratic functions (Q688922) (← links)
- On convergence in mixed integer programming (Q715071) (← links)
- Asymptotic expansions for interior penalty solutions of control constrained linear-quadratic problems (Q715082) (← links)
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization (Q715240) (← links)
- Robust inversion, dimensionality reduction, and randomized sampling (Q715245) (← links)
- Erratum to: ``Computational complexity of stochastic programming problems'' (Q747782) (← links)
- A note on an approximate Lagrange multiplier rule (Q849326) (← links)
- Sums of random symmetric matrices and quadratic optimization under orthogonality constraints (Q868470) (← links)
- Machine scheduling with resource dependent processing times (Q877194) (← links)
- Strong LP formulations for scheduling splittable jobs on unrelated machines (Q896269) (← links)
- Reverse split rank (Q896287) (← links)
- On large scale nonlinear network optimization (Q908858) (← links)
- Recognizing underlying sparsity in optimization (Q1013977) (← links)
- Uses and abuses of statistical simulation (Q1104027) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- Numerical comparisons of nonlinear programming algorithms on serial and vector processors using automatic differentiation (Q1116896) (← links)
- A constructive proof of a permutation-based generalization of Sperner's lemma (Q1120843) (← links)
- Facets for the cut cone. I (Q1199749) (← links)
- Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming (Q1290596) (← links)
- A branch and bound method for stochastic global optimization (Q1290672) (← links)
- A note on the convergence of barrier algorithms to second-order necessary points (Q1300281) (← links)
- A new technique for generating quadratic programming test problems (Q1315416) (← links)
- Multicommodity network flows: The impact of formulation on decomposition (Q1321667) (← links)
- A general cone decomposition theory based on efficiency (Q1334950) (← links)
- Solving mixed integer nonlinear programs by outer approximation (Q1337138) (← links)
- A note on exploiting structure when using slack variables (Q1340068) (← links)
- Logical analysis of numerical data (Q1365054) (← links)
- Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)
- Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm (Q1373746) (← links)
- Rounding algorithms for covering problems (Q1380937) (← links)
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra (Q1396210) (← links)
- Progress on perfect graphs (Q1403295) (← links)
- On the separation of split cuts and related inequalities (Q1411614) (← links)
- Optimal labeling of point features in rectangular labeling models (Q1411626) (← links)
