The following pages link to (Q2724100):
Displaying 50 items.
- A computational study for bilevel quadratic programs using semidefinite relaxations (Q323274) (← links)
- Adaptive nested optimization scheme for multidimensional global search (Q330495) (← links)
- Maximizing for the sum of ratios of two convex functions over a convex set (Q336507) (← links)
- The profit maximization problem in economies of scale (Q415243) (← links)
- Farkas' lemma in random locally convex modules and Minkowski-Weyl type results in \(L^0(\mathcal F,R^n)\) (Q488661) (← links)
- Switching stepsize strategies for sequential quadratic programming (Q635801) (← links)
- The sagitta method for solving linear programs (Q703904) (← links)
- Bounds in multi-horizon stochastic programs (Q827134) (← links)
- Minimum cost multicommodity network flow problem in time-varying networks: by decomposition principle (Q828730) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- An efficient string sorting algorithm for weighing matrices of small weight (Q845549) (← links)
- On minimum weight pseudo-triangulations (Q924080) (← links)
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications (Q974991) (← links)
- On a recurrence algorithm for continuous-time linear fractional programming problems (Q980279) (← links)
- Positive semidefinite matrix completions on chordal graphs and constraint nondegeneracy in semidefinite programming (Q999796) (← links)
- A method for improving the accuracy of data mining classification algorithms (Q1017461) (← links)
- Convex integer maximization via Graver bases (Q1017675) (← links)
- Optimum allocation in stratified surveys: stochastic programming (Q1019933) (← links)
- Multi-objective evacuation routing in transportation networks (Q1026767) (← links)
- The origins of quasi-concavity: a development between mathematics and economics. (Q1427538) (← links)
- La valeur optimale des programmes entiers. (The optimal value of integer programs) (Q1565885) (← links)
- Fast approximate \(L_\infty\) minimization: speeding up robust regression (Q1623573) (← links)
- Infinite-horizon multiobjective optimal control problems for bounded processes (Q1713278) (← links)
- A global optimization point of view to handle non-standard object packing problems (Q1941035) (← links)
- Convex underestimators of polynomials (Q1955542) (← links)
- Incremental method for multiple line detection problem -- iterative reweighted approach (Q1998212) (← links)
- A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem (Q2022324) (← links)
- Underestimation functions for a rank-two partitioning method (Q2026521) (← links)
- A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints (Q2047183) (← links)
- Review and comparison of algorithms and software for mixed-integer derivative-free optimization (Q2114591) (← links)
- Inextensible surface reconstruction under small relative deformations from distributed angle measurements (Q2118426) (← links)
- Farkas lemma for convex systems revisited and applications to sublinear-convex optimization problems (Q2351175) (← links)
- D-optimal matrices via quadratic integer optimization (Q2359153) (← links)
- Generating functions and duality for integer programs (Q2386200) (← links)
- Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes (Q2422874) (← links)
- The generic Gröbner walk (Q2457423) (← links)
- Solving a dynamic separation problem using MINLP techniques (Q2480935) (← links)
- A characterization of concordance relations (Q2485338) (← links)
- Application of deterministic low-discrepancy sequences in global optimization (Q2488052) (← links)
- Fractional programming with convex quadratic forms and functions (Q2496064) (← links)
- A sequential cutting plane algorithm for solving convex NLP problems (Q2496070) (← links)
- All stability multipliers for repeated MIMO nonlinearities (Q2504537) (← links)
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm (Q2506191) (← links)
- Comparison of different multivariable control design methods applied on half car test setup (Q2512067) (← links)
- Optimal solutions to a class of nonconvex minimization problems with linear inequality constraints (Q2518699) (← links)
- On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization (Q2660812) (← links)
- A proximal ADMM with the Broyden family for convex optimization problems (Q2666686) (← links)
- The multidimensional truncated moment problem: the moment cone (Q2669362) (← links)
- An Algorithm for Construction of Constrained D-Optimum Designs (Q2833401) (← links)
- Global Optimization of Mixed-Integer Signomial Programming Problems (Q2897303) (← links)
