Pages that link to "Item:Q1353375"

The following pages link to Optimization on low rank nonconvex structures (Q1353375):

Displaying 50 items.

• Global optimization algorithm for sum of generalized polynomial ratios problem (Q345766) (← links)
• An FPTAS for optimizing a class of low-rank functions over a polytope (Q378129) (← links)
• An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem (Q427361) (← links)
• Improvements by analyzing the efficient frontier in DEA (Q439350) (← links)
• Solving DC programs using the cutting angle method (Q486726) (← links)
• Range division and compression algorithm for quadratically constrained sum of quadratic ratios (Q520268) (← links)
• Linear decomposition approach for a class of nonconvex programming problems (Q523884) (← links)
• Constant rebalanced portfolio optimization under nonlinear transaction costs (Q538327) (← links)
• Dual and bidual problems for a Lipschitz optimization problem based on quasi-conjugation (Q631850) (← links)
• An inner approximation method incorporating with a penalty function method for a reverse convex programming problem (Q697546) (← links)
• A branch and reduce approach for solving a class of low rank d.c. programs (Q732158) (← links)
• Optimizing over the properly efficient set of convex multi-objective optimization problems (Q828826) (← links)
• Outer approximation method incorporating a quadratic approximation for a DC programming problem (Q848730) (← links)
• Global maximization of a generalized concave multiplicative function (Q927239) (← links)
• An efficient algorithm for solving convex-convex quadratic fractional programs (Q946299) (← links)
• \(\alpha \)-conservative approximation for probabilistically constrained convex programs (Q969716) (← links)
• Solving a large scale semi-definite logit model (Q970129) (← links)
• Theoretical and algorithmic results for a class of hierarchical fleet mix problems (Q1042052) (← links)
• A note on composite concave quadratic programming (Q1306393) (← links)
• Simplicially-constrained DC optimization over efficient and weakly efficient sets (Q1411519) (← links)
• Bounds for global optimization of capacity expansion and flow assignment problems (Q1591547) (← links)
• Recent developments and trends in global optimization (Q1593827) (← links)
• Global optimization for a class of nonlinear sum of ratios problem (Q1717663) (← links)
• Preconditioned ADMM for a class of bilinear programming problems (Q1721110) (← links)
• Global optimization for generalized linear multiplicative programming using convex relaxation (Q1721616) (← links)
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems (Q1772961) (← links)
• A branch and bound algorithm for solving a class of D-C programming (Q1780534) (← links)
• An out space accelerating algorithm for generalized affine multiplicative programs problem (Q1794179) (← links)
• Solving a class of multiplicative programs with 0-1 knapsack constraints (Q1969464) (← links)
• A new algorithm for concave quadratic programming (Q2010088) (← links)
• Underestimation functions for a rank-two partitioning method (Q2026521) (← links)
• A new polynomially solvable class of quadratic optimization problems with box constraints (Q2047220) (← links)
• A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming (Q2375741) (← links)
• Global optimization of a rank-two nonconvex program (Q2379188) (← links)
• Global optimization for the sum of generalized polynomial fractional functions (Q2460040) (← links)
• A novel approach to bilevel nonlinear programming (Q2465482) (← links)
• A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems (Q2479840) (← links)
• Minimization of the ratio of functions defined as sums of the absolute values (Q2483046) (← links)
• Mean-variance portfolio optimal problem under concave transaction cost (Q2490186) (← links)
• Global optimization algorithm for a generalized linear multiplicative programming (Q2511121) (← links)
• \(NP\)-hardness of linear multiplicative programming and related problems (Q2564608) (← links)
• Optimization of a long-short portfolio under nonconvex transaction cost (Q2574062) (← links)
• Robust solution of nonconvex global optimization problems (Q2576450) (← links)
• Solving sum-of-ratios fractional programs using efficient points (Q2743661) (← links)
• Global optimization for robust control synthesis based on the Matrix Product Eigenvalue Problem (Q2755397) (← links)
• A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← links)
• Separable convexification and DCA techniques for capacity and flow assignment problems (Q2773173) (← links)
• (Q4240821) (← links)
• An efficient algorithm for computing a class of multiplicative optimization problem (Q5069808) (← links)
• Global optimization algorithm for solving linear multiplicative programming problems (Q5085229) (← links)