Convex analysis and global optimization
From MaRDI portal
Publication:5906869
zbMATH Open0904.90156MaRDI QIDQ5906869FDOQ5906869
Authors: Hoang Tuy 
Publication date: 24 February 1998
Published in: Nonconvex Optimization and Its Applications (Search for Journal in Brave)
Recommendations
global optimizationconvex analysisquasiconvexitynonconvex quadratic programmingdifference of convex functions
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Nonsmooth analysis (49J52) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02)
Cited In (only showing first 100 items - show all)
- Computing lower and upper expectations under epistemic independence
- Global optimization for the sum of concave-convex ratios problem
- Global optimization of a rank-two nonconvex program
- Global optimization for the sum of generalized polynomial fractional functions
- On local search in d.c. optimization problems
- A method for approximating pairwise comparison matrices by consistent matrices
- A parametric approach for solving a class of generalized quadratic-transformable rank-two nonconvex programs
- A Method for Minimization of Quasidifferentiable Functions
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
- Title not available (Why is that?)
- Optimization of a long-short portfolio under nonconvex transaction cost
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
- A Complexity Analysis of Local Search Algorithms in Global Optimization
- A global optimization procedure for the location of a median line in the three-dimensional space
- Global descent method for constrained continuous global optimization
- Convexification and concavification for a general class of global optimization problems
- A new accelerating method for globally solving a class of nonconvex programming problems
- An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
- Optimization of the norm of a vector-valued DC function and applications
- Abstract convexity and global optimization
- A review of recent advances in global optimization
- A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm
- Optimality conditions in global optimization and their applications
- Global optimality conditions for some classes of optimization problems
- A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies
- An extended Fenchel-Lagrange duality approach and optimality conditions for strong bilevel programming problems
- Partitioning procedure for polynomial optimization
- Adjustable robust optimization models for a nonlinear two-period system
- Global optimization method for linear multiplicative programming
- A continuous approch for globally solving linearly constrained quadratic
- Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
- Constant rebalanced portfolio optimization under nonlinear transaction costs
- Sign reversion approach to concave minimization problems
- A storm of feasibility pumps for nonconvex MINLP
- A practicable branch and bound algorithm for sum of linear ratios problem
- Reverse convex problems: an approach based on optimality conditions
- Global optimization algorithm for sum of generalized polynomial ratios problem
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Piecewise-linear approximations of multidimensional functions
- Recent developments and trends in global optimization
- Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- A filled function method for constrained global optimization
- A novel approach to bilevel nonlinear programming
- A computational comparison of some branch and bound methods for indefinite quadratic programs
- An outcome space approach for generalized convex multiplicative programs
- Two-dimensional Banach spaces with polynomial numerical index zero
- DC approach to weakly convex optimization and nonconvex quadratic optimization problems
- Generalized S-lemma and strong duality in nonconvex quadratic programming
- Convex analysis and global optimization
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Functional inequalities and theorems of the alternative involving composite functions
- A robust algorithm for quadratic optimization under quadratic constraints
- Continuum limit for some growth models.
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
- Solving DC programs using the cutting angle method
- Outlier detection and least trimmed squares approximation using semi-definite programming
- A convergent conical algorithm with \(\omega \)-bisection for concave minimization
- A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization
- LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION
- Positively homogeneous functions revisited
- A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems
- Mean-variance portfolio optimal problem under concave transaction cost
- Fractional programming with convex quadratic forms and functions
- Robust solution of nonconvex global optimization problems
- A general global optimization approach for solving location problems in the plane
- Toland-singer formula cannot distinguish a global minimizer from a choice of stationary points*
- Global maximization of a generalized concave multiplicative function
- A branch and bound algorithm for solving a class of D-C programming
- A local search method for optimization problem with d.c. inequality constraints
- Outer approximation algorithms for canonical DC problems
- On a decomposition method for nonconvex global optimization
- A global optimization approach for generating efficient points for multiobjective concave fractional programs
- On solving nonconvex optimization problems by reducing the duality gap
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
- Conjugate duality for concave maximization problems and applications
- A set-membership state estimation algorithm based on DC programming
- Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver
- Global optimization for sum of generalized fractional functions
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
- Optimization of a quadratic function with a circulant matrix
- Regional division and reduction algorithm for minimizing the sum of linear fractional functions
- The design of optimum component test plans for system reliability
- On the solution existence to convex polynomial programs and its applications
- Asset price bubbles, market liquidity, and systemic risk
- Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions
- Piecewise linear bounding functions in univariate global optimization
- Numerical solution for bounding feasible point sets
- On solving the sum-of-ratios problem
- \(\alpha \)-conservative approximation for probabilistically constrained convex programs
- Robust semidefinite programming problems with general nonlinear parameter dependence: approaches using the DC-representations
- An inner approximation method incorporating with a penalty function method for a reverse convex programming problem
- Inner approximation method for a reverse convex programming problem
- A heuristic approach to solving a class of bilinear matrix inequality problems
- On the pervasiveness of difference-convexity in optimization and statistics
- Outer approximation method incorporating a quadratic approximation for a DC programming problem
- Maximization of generalized convex functionals in locally convex spaces.
- Title not available (Why is that?)
- Visualizing data as objects by DC (difference of convex) optimization
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
This page was built for publication: Convex analysis and global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5906869)
