Convex analysis and global optimization
From MaRDI portal
Publication:5906869
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)
Recommendations
Cited in
(only showing first 100 items - show all)- Functional inequalities and theorems of the alternative involving composite functions
- Computing lower and upper expectations under epistemic independence
- Global maximization of a generalized concave multiplicative function
- Sign reversion approach to concave minimization problems
- Fractional programming with convex quadratic forms and functions
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
- A branch and bound algorithm for solving a class of D-C programming
- A robust algorithm for quadratic optimization under quadratic constraints
- A filled function method for constrained global optimization
- A set-membership state estimation algorithm based on DC programming
- A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization
- On local search in d.c. optimization problems
- Optimality conditions in global optimization and their applications
- Global optimization for sum of generalized fractional functions
- A novel approach to bilevel nonlinear programming
- Outer approximation algorithms for canonical DC problems
- A computational comparison of some branch and bound methods for indefinite quadratic programs
- Global optimality conditions for some classes of optimization problems
- A review of recent advances in global optimization
- Global descent method for constrained continuous global optimization
- A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm
- Convexification and concavification for a general class of global optimization problems
- A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies
- An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
- A Complexity Analysis of Local Search Algorithms in Global Optimization
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
- Continuum limit for some growth models.
- A continuous approch for globally solving linearly constrained quadratic
- An extended Fenchel-Lagrange duality approach and optimality conditions for strong bilevel programming problems
- A global optimization procedure for the location of a median line in the three-dimensional space
- On a decomposition method for nonconvex global optimization
- A parametric approach for solving a class of generalized quadratic-transformable rank-two nonconvex programs
- Global optimization of a rank-two nonconvex program
- Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience
- A Method for Minimization of Quasidifferentiable Functions
- Positively homogeneous functions revisited
- Partitioning procedure for polynomial optimization
- Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver
- An outcome space approach for generalized convex multiplicative programs
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: Convergence analysis and numerical results
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
- Robust solution of nonconvex global optimization problems
- A global optimization approach for generating efficient points for multiobjective concave fractional programs
- Adjustable robust optimization models for a nonlinear two-period system
- Outlier detection and least trimmed squares approximation using semi-definite programming
- Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- A general global optimization approach for solving location problems in the plane
- On solving nonconvex optimization problems by reducing the duality gap
- Global optimization method for linear multiplicative programming
- Piecewise-linear approximations of multidimensional functions
- Two-dimensional Banach spaces with polynomial numerical index zero
- Recent developments and trends in global optimization
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
- Constant rebalanced portfolio optimization under nonlinear transaction costs
- A practicable branch and bound algorithm for sum of linear ratios problem
- DC approach to weakly convex optimization and nonconvex quadratic optimization problems
- A method for approximating pairwise comparison matrices by consistent matrices
- Optimization of the norm of a vector-valued DC function and applications
- LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION
- Optimization of a long-short portfolio under nonconvex transaction cost
- Optimization of a quadratic function with a circulant matrix
- Abstract convexity and global optimization
- A local search method for optimization problem with d.c. inequality constraints
- A convergent conical algorithm with \(\omega \)-bisection for concave minimization
- A storm of feasibility pumps for nonconvex MINLP
- Global optimization for the sum of concave-convex ratios problem
- Generalized S-lemma and strong duality in nonconvex quadratic programming
- Reverse convex problems: an approach based on optimality conditions
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
- Global optimization algorithm for sum of generalized polynomial ratios problem
- Convex analysis and global optimization
- A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems
- Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
- Conjugate duality for concave maximization problems and applications
- Global optimization for the sum of generalized polynomial fractional functions
- Toland-singer formula cannot distinguish a global minimizer from a choice of stationary points*
- A new accelerating method for globally solving a class of nonconvex programming problems
- Solving DC programs using the cutting angle method
- Mean-variance portfolio optimal problem under concave transaction cost
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- New global optimality conditions for nonsmooth DC optimization problems
- Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems
- Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems
- An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation
- Convexification techniques for linear complementarity constraints
- A smoothing approximation-based adaptive neurodynamic approach for nonsmooth resource allocation problem
- A difference of convex optimization algorithm for piecewise linear regression
- A modified version of a Benson-type algorithm proposed for obtaining solutions with better dispersion on the non-dominated set of a non-convex multi-objective programming problem
- Convexity and montonicity in global optimization.
- The formulas for the representation of functions of two variables as a difference of sublinear functions
- Necessary and sufficient optimality conditions in DC semi-infinite programming
- Analysis and algorithms for some compressed sensing models based on L1/L2 minimization
- Incremental DC optimization algorithm for large-scale clusterwise linear regression
- Rank-two programs involving linear fractional functions
- Global optimization algorithm for solving linear multiplicative programming problems
- A novel method for solving nonmonotone equilibrium problems
- A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming
- Convexity and global optimization: A theoretical link
- Robust piecewise linear L1-regression via nonsmooth DC optimization
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)
