scientific article; zbMATH DE number 1821400

MaRDI QIDQ4779970zbMATH OpenFDO

Authors A. Auslender, Marc Teboulle

Publication date 29 October 2002

zbMATH Keywords

asymptotic conesdualitysubdifferentialvariational inequalitiesasymptotic functionssubdifferential calculusstability of constrained optimization problems

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Variational inequalities (49J40) Sensitivity, stability, well-posedness (49K40) Research exposition (monographs, survey articles) pertaining to calculus of variations and optimal control (49-02)

Recommendations

• Optimization and variational inequalities with pseudoconvex functions
• A quasiconvex asymptotic function with applications in optimization
• Variational Convexity of Functions and Variational Sufficiency in Optimization
• Variational inequalities for functions on convex sets
• Nonconvex functions and variational inequalities
• Variational aspects of generalized convex functions
• scientific article; zbMATH DE number 3441151
• Convexity and variational analysis
• Variational inequalities with cone constraints
• A general asymptotic function with applications in nonconvex optimization

Cited in

(only showing first 100 items - show all)

• Generalized convexity, nonsmooth variational inequalities, and nonsmooth optimization
• Global error bounds for piecewise convex polynomials
• Some convex programs without a duality gap
• Maximizing and minimizing quasiconvex functions: related properties, existence and optimality conditions via radial epiderivatives
• An elementary proof of the existence of solutions of a monotone variational inequality in the finite-dimensional case
• Generalized quasi-variational-like hemivariational inequalities
• Variational convergence for vector-valued functions and its applications to convex multiobjective optimization
• Convex analysis can be helpful for the asymptotic analysis of monotone operators
• Asymptotic analysis for proximal-type methods in vector variational inequality problems
• A convergence for infinite dimensional vector valued functions
• Modified Lagrangian methods for separable optimization problems
• On nonconvex pseudomonotone equilibrium problems with applications
• Near equality, near convexity, sums of maximally monotone operators, and averages of firmly nonexpansive mappings
• Tikhonov-type regularization method for efficient solutions in vector optimization
• Stability of set-valued optimization problems with naturally quasi-functions
• Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity
• Duality for \(\varepsilon \)-variational inequality
• Minimum recession-compatible subsets of closed convex sets
• The resolvent average of monotone operators: dominant and recessive properties
• Asymptotic analysis in convex composite multiobjective optimization problems
• Image space analysis for variational inequalities with cone constraints and applications to traffic equilibria
• Firmly nonexpansive mappings and maximally monotone operators: correspondence and duality
• Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions
• A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
• Stability results for properly quasi convex vector optimization problems
• Feasibility-solvability theorems for generalized vector equilibrium problem in reflexive Banach spaces
• Dual convergence for penalty algorithms in convex programming
• Implicit relaxed and hybrid methods with regularization for minimization problems and asymptotically strict pseudocontractive mappings in the intermediate sense
• Zero duality gap for convex programs: a generalization of the Clark-Duffin theorem
• Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder)
• On the nonemptiness and compactness of the solution sets for vector variational inequalities
• Disparity and optical flow partitioning using extended Potts priors
• Characterizing smooth affine spherical varieties via the automorphism group
• On conic QPCCs, conic QCQPs and completely positive programs
• A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
• Generic primal-dual solvability in continuous linear semi-infinite programming
• Existence of global minima for constrained optimization
• Optimal affine leader functions in reverse Stackelberg games. Existence conditions and characterization
• A characterization of nonemptiness and boundedness of the solution sets for equilibrium problems
• Solving disjunctive optimization problems by generalized semi-infinite optimization techniques
• A regularization method for ill-posed bilevel optimization problems
• On unions and intersections of nested families of cones
• Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
• On the set of weakly efficient minimizers for convex multiobjective programming
• Dual semidefinite programs without duality gaps for a class of convex minimax programs
• First- and second-order asymptotic analysis with applications in quasiconvex optimization
• Mixed integer programming with a class of nonlinear convex constraints
• Subgradients of marginal functions in parametric mathematical programming
• New Farkas-type constraint qualifications in convex infinite programming
• Error bounds for mixed integer nonlinear optimization problems
• Strict feasibility and stable solvability of bifunction variational inequalities
• A globally linearly convergent method for pointwise quadratically supportable convex-concave saddle point problems
• Interior projection-like methods for monotone variational inequalities
• Set intersection theorems and existence of optimal solutions
• Strict feasibility and solvability for vector equilibrium problems in reflexive Banach spaces
• Error bounds and stability in the \(\ell_0\) regularized for CT reconstruction from small projections
• Stability for convex vector optimization problems
• Semi-continuous quadratic optimization: existence conditions and duality scheme
• Symbolic Fenchel conjugation
• Slice-continuous sets in reflexive Banach spaces: convex constrained optimization and strict convex separation
• Existence-stability theorems for strong vector set-valued equilibrium problems in reflexive Banach spaces
• Characterizations of error bounds for lower semicontinuous functions on metric spaces
• Transport between RGB images motivated by dynamic optimal transport
• A convergence for vector valued functions
• A new class of costs for optimal transport planning
• On minimization over weakly efficient sets
• A complete characterization of strong duality in nonconvex optimization with a single constraint
• Iterative algorithm for fixed point problems of generalized nearly asymptotically nonexpansive mappings and solutions of a system of generalized nonlinear variational-like inclusions
• Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
• Dual randomized coordinate descent method for solving a class of nonconvex problems
• Asymptotic analysis, existence and sensitivity results for a class of multivalued complementarity problems
• Strong duality and minimal representations for cone optimization
• A new class of alternative theorems for SOS-convex inequalities and robust optimization
• Support and separation properties of convex sets in finite dimension
• A note on the existence of nonsmooth nonconvex optimization problems
• On the lower semicontinuity of the value function and existence of solutions in quasiconvex optimization
• Optical flow
• On global subdifferentials with applications in nonsmooth optimization
• A sufficient condition for asymptotically well behaved property of convex polynomials
• Newton's method with feasible inexact projections for solving constrained generalized equations
• Convergence results for Henig proper efficient solution sets of vector optimization problems
• On the nonemptiness and boundedness of solution sets of weakly homogeneous optimization problems
• Polar convolution
• A characteristic method for fully convex Bolza problems over arcs of bounded variation
• The projected polar proximal point algorithm converges globally
• Optimal control of higher order differential inclusions with functional constraints
• Characterizing bad semidefinite programs: normal forms and short proofs
• The relation between rough Wijsman convergence and asymptotic cones
• Existence results for solutions of mixed tensor variational inequalities
• Characterizing quasiconvexity of the pointwise infimum of a family of arbitrary translations of quasiconvex functions, with applications to sums and quasiconvex optimization
• Stability of a convex feasibility problem
• Solvability of a regular polynomial vector optimization problem without convexity
• Asymptotic planes and closedness conditions for linear images and vector sums of sets
• A simplified view of first order methods for optimization
• On the solution existence and stability of polynomial optimization problems
• The q-asymptotic function in c-convex analysis
• A Frank-Wolfe-type theorem for cubic programs and solvability for quadratic variational inequalities
• Quadratic fractional programming under asymptotic analysis
• An eaves type theorem for quadratic fractional programming problems and its applications
• Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4779970)