Pages that link to "Item:Q5906869"

The following pages link to Convex analysis and global optimization (Q5906869):

Displaying 50 items.

• Global optimization method for linear multiplicative programming (Q2355349) (← links)
• Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set (Q2358305) (← links)
• Convex optimization on mixed domains (Q2358856) (← 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)
• A robust algorithm for quadratic optimization under quadratic constraints (Q2385494) (← links)
• Generalized S-lemma and strong duality in nonconvex quadratic programming (Q2392110) (← links)
• Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems (Q2392776) (← links)
• A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes (Q2399479) (← links)
• On solving the sum-of-ratios problem (Q2422872) (← links)
• A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints (Q2425955) (← links)
• The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions (Q2438323) (← links)
• Outlier detection and least trimmed squares approximation using semi-definite programming (Q2445775) (← links)
• Global optimization for the sum of generalized polynomial fractional functions (Q2460040) (← links)
• Accelerating convergence of cutting plane algorithms for disjoint bilinear programming (Q2460141) (← links)
• On a decomposition method for nonconvex global optimization (Q2463828) (← links)
• A novel approach to bilevel nonlinear programming (Q2465482) (← links)
• A set-membership state estimation algorithm based on DC programming (Q2476226) (← links)
• Global optimization for sum of generalized fractional functions (Q2479363) (← links)
• A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems (Q2479840) (← links)
• Adjustable robust optimization models for a nonlinear two-period system (Q2481117) (← links)
• Mean-variance portfolio optimal problem under concave transaction cost (Q2490186) (← links)
• On solving nonconvex optimization problems by reducing the duality gap (Q2494287) (← links)
• Fractional programming with convex quadratic forms and functions (Q2496064) (← links)
• Design and analysis of linear precoders under a mean square error criterion. I: foundations and worst case designs (Q2503495) (← links)
• Optimization of a long-short portfolio under nonconvex transaction cost (Q2574062) (← links)
• Continuum limit for some growth models. (Q2574499) (← links)
• Robust solution of nonconvex global optimization problems (Q2576450) (← links)
• Computing with Fisher geodesics and extended exponential families (Q2631368) (← links)
• Capital asset market equilibrium with liquidity risk, portfolio constraints, and asset price bubbles (Q2633454) (← links)
• Robust market equilibria under uncertain cost (Q2672150) (← links)
• Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints (Q2692792) (← links)
• An alogrithm for monotonic global optimization problems^∗ (Q2720273) (← links)
• A continuous approch for globally solving linearly constrained quadratic (Q2767579) (← links)
• Convexity and montonicity in global optimization. (Q2768076) (← links)
• Survey of Piecewise Convex Maximization and PCMP over Spherical Sets (Q2958613) (← links)
• A global optimization approach for generating efficient points for multiobjective concave fractional programs (Q3074953) (← links)
• Toland-singer formula cannot distinguish a global minimizer from a choice of stationary points^* (Q4239759) (← links)
• Relaxations of parameterized LMIs with control applications (Q4240821) (← links)
• A new Lagrangian dual global optimization algorithm for solving bilinear matrix inequalities (Q4498100) (← links)
• LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION (Q4548044) (← links)
• Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming (Q4571882) (← links)
• Nonsmooth DC programming approach to clusterwise linear regression: optimality conditions and algorithms (Q4638918) (← links)
• DC approach to weakly convex optimization and nonconvex quadratic optimization problems (Q4639126) (← links)
• (Q4691898) (← links)
• A Method for Minimization of Quasidifferentiable Functions (Q4806341) (← links)
• A Complexity Analysis of Local Search Algorithms in Global Optimization (Q4806344) (← links)
• (Q4830373) (← links)
• Analysis and Algorithms for Some Compressed Sensing Models Based on L1/L2 Minimization (Q4997175) (← links)
• Convergent Algorithms for a Class of Convex Semi-infinite Programs (Q5043283) (← links)