scientific article; zbMATH DE number 757676
From MaRDI portal
Publication:4833805
zbMath0832.90111MaRDI QIDQ4833805
Publication date: 23 May 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
reverse convex programmingreviewd.c. functionscontinuous optimizationdifferences of convex functions
Convex programming (90C25) Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
On global search in nonconvex optimal control problems, Convergence guarantees for a class of non-convex and non-smooth optimization problems, A revision of the rectangular algorithm for a class of DC optimization problems, Mode discernibility and bounded-error state estimation for nonlinear hybrid systems, Solving the median problem with continuous demand on a network, DC Programming Approaches for BMI and QMI Feasibility Problems, Constrained, Global Optimization of Unknown Functions with Lipschitz Continuous Gradients, Uniform tree approximation by global optimization techniques, Characterizing global optimality for DC optimization problems under convex inequality constraints, Outer approximation algorithms for DC programs and beyond, Global optimality conditions in nonconvex optimization, Clustering and the perturbed spatial median, Geometric metrology. I: Separation functionals in tolerance assessment, New Bregman proximal type algoritms for solving DC optimization problems, Optimality conditions in the problem of maximization of the difference of two convex functions, Minimax D-optimal designs for multivariate regression models with multi-factors, Beyond canonical dc-optimization: the single reverse polar problem, Recent progress on integrally convex functions, Global optimality conditions and exact penalization, A dynamic analytic method for risk-aware controlled martingale problems, Continuous Relaxation for Discrete DC Programming, Computation of the maximum likelihood estimator in low-rank factor analysis, Gradual cover competitive facility location, Learning latent and hierarchical structures in cognitive diagnosis models, On global optimality conditions and cutting plane algorithms, Minimizing sequences in a constrained DC optimization problem, A new necessary and sufficient global optimality condition for canonical DC problems, Solving polyhedral d.c. optimization problems via concave minimization, Canonical Duality-Triality Theory: Unified Understanding for Modeling, Problems, and NP-Hardness in Global Optimization of Multi-Scale Systems, Global optimality conditions for optimal control problems with functions of A.D. Alexandrov, An algorithm for bounded-error identification of nonlinear systems based on DC functions, On cone d. c. optimization and conjugate duality, Some new Farkas-type results for inequality systems with DC functions, DC programming: overview., On modeling and global solutions for d.c. optimization problems by canonical duality theory, Accelerating convergence of cutting plane algorithms for disjoint bilinear programming, Single-facility huff location problems on networks, Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs, A computational comparison of some branch and bound methods for indefinite quadratic programs, A framework of discrete DC programming by discrete convex analysis, Maps with the Radon-Nikodým property, Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization, DC decomposition of nonconvex polynomials with algebraic techniques, Continuous relaxation for discrete DC programming, Support points, A set-membership state estimation algorithm based on DC programming, Optimization of the norm of a vector-valued DC function and applications, Stability of saddle points via explicit coderivatives of pointwise subdifferentials, On global unconstrained minimization of the difference of polyhedral functions, Duality principles for optimization problems dealing with the difference of vector-valued convex mappings, Quadratic Majorization for Nonconvex Loss with Applications to the Boosting Algorithm, Simplified optimality conditions for minimizing the difference of vector-valued functions, On the norm of a dc function, Outer approximation algorithms for canonical DC problems, Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function, Reformulations in Mathematical Programming: Definitions and Systematics, Optimality conditions for minimizing the difference of nonconvex vector-valued mappings, On Lagrange Duality for Several Classes of Nonconvex Optimization Problems, New global optimality conditions for nonsmooth DC optimization problems, Technical efficiency and distance to a reverse convex set, Difference of convex solution of quadratically constrained optimization problems., On Tikhonov's reciprocity principle and optimality conditions in d. c. optimization, Concave programming and DH-point, Perfect duality theory and complete solutions to a class of global optimization problems*, DC programming and DCA for globally solving the value-at-risk, Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint, Comments on: Algorithms for linear programming with linear complementarity constraints, Robust solution of nonconvex global optimization problems, SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs, Optimization hierarchy for fair statistical decision problems
