A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
From MaRDI portal
Publication:4126077
DOI10.1007/BF01593777zbMath0354.90075OpenAlexW1970946112MaRDI QIDQ4126077
Publication date: 1977
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01593777
Related Items
Convergence of the BFGS-SQP Method for Degenerate Problems, Existence and sensitivity analysis for nonconvex cubic optimization problems, Revisiting degeneracy, strict feasibility, stability, in linear programming, Convergence rate estimates for penalty methods revisited, Strongly Stable Stationary Points for a Class of Generalized Equations, Optimization of the optimal value function in problems of convex parametric programming, Unnamed Item, A Predictor-Corrector Path-Following Algorithm for Dual-Degenerate Parametric Optimization Problems, Global and local convergence of a filter line search method for nonlinear programming, On differentiability properties of player convex generalized Nash equilibrium problems, Solution of bilevel optimization problems using the KKT approach, Intrinsic Formulation of KKT Conditions and Constraint Qualifications on Smooth Manifolds, Unnamed Item, Nonregular mixed-constrained optimization problems, Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems, Existence of augmented Lagrange multipliers for semi-infinite programming problems, Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints, Strict convex regularizations, proximal points and augmented lagrangians, Directional differentiability of optimal solutions under Slater's condition, Stability for linearly constrained optimization problems, The generalized jacobian of the optimal solution in parametric optimization, Qualification conditions for multivalued functions in Banach spaces with applications to nonsmooth vector optimization problems, Necessary optimality conditions in terms of convexificators in Lipschitz optimization, Hadamard semidifferential, oriented distance function, and some applications, Second order multipliers and marginal function in non linear programs, Relation between the constant rank and the relaxed constant rank constraint qualifications, Feasible direction method for bilevel programming problem, On regularity and stability in semi-infinite optimization, Sensitivity analysis for non-linear programs with linear constraints, Feasible Method for Semi-Infinite Programs, An Interior-Point $$\boldsymbol{\ell_{1}}$$ -Penalty Method for Nonlinear Optimization, Perturbation theory of nonlinear programs when the set of optimal solutions is not a singleton, Convexificators and boundedness of the Kuhn–Tucker multipliers set, Certification aspects of the fast gradient method for solving the dual of parametric convex programs, Separation of sets, Lagrange multipliers, and totally regular extremum problems, Quasi-contingent derivatives and studies of higher-orders in nonsmooth optimization, Smoothness properties of a regularized gap function for quasi-variational inequalities, Continuity and directional differentiability of the value function in parametric quadratically constrained nonconvex quadratic programs, On generalized semi-infinite programming. (With comments and rejoinder)., Computing optimal incentives via bilevel programming, On stability concepts in nonlinear programming, Second-order analysis of penalty function, On the stability of solutions in honlinear programming, An extension of Yuan's lemma and its applications in optimization, On saddle points in nonconvex semi-infinite programming, Implications of the constant rank constraint qualification, Unnamed Item, On robust Karush-Kuhn-Tucker multipliers rules for semi-infinite multiobjective optimization with data uncertainty, A necessary and a sufficient optimality condition for bilevel programming problems, Calabi-Polyak convexity theorem, Yuan'S lemma and S-lemma: extensions and applications, Structural stability in nonlinear optimization, A filter-type method for solving nonlinear semidefinite programming, Bounded sets of KKT multipliers in vector optimization, Quasidifferntiability of optimal solutions in parametric optimal solutions in parametric nonlinear optimization, On differential stability in stochastic programming, Bilevel problems over polyhedra with extreme point optimal solutions, Reduction of the bilevel stochastic optimization problem with quantile objective function to a mixed‐integer problem, Application of the Armijo stepsize rule to the solution of a nonlinear system of equalities and inequalities, Lagrange multipliers for multiobjective programs with a general preference, Nonlinear optimization: Characterization of structural stability, Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development, On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods, Is bilevel programming a special case of a mathematical program with complementarity constraints?, Boundedness of certain sets of Lagrange multipliers in vector optimization, Generalized sensitivity analysis of nonlinear programs using a sequence of quadratic programs, A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem, On stability of solutions to parametric generalized affine variational inequalities, A Regularized Factorization-Free Method for Equality-Constrained Optimization, Bounded sets of Lagrange multipliers for vector optimization problems in infinite dimension, Existence and boundedness of second-order Karush-Kuhn-Tucker multipliers for set-valued optimization with variable ordering structures, On smoothness properties of optimal value functions at the boundary of their domain under complete convexity, Generalized envelope theorems: applications to dynamic programming, Bounded Lagrange multiplier rules for general nonsmooth problems and application to mathematical programs with equilibrium constraints, On the directional derivative of the optimal solution mapping without linear independence constraint qualification, Low-rank matrix completion using nuclear norm minimization and facial reduction, Some properties of regularization and penalization schemes for MPECs, A modified SLP algorithm and its global convergence, Uniqueness of KKT multipliers in multiobjective optimization., A general equilibrium analysis of strategic arbitrage, On the classical necessary second-order optimality conditions, A nondegenerate fuzzy optimality condition for constrained optimization problems without qualification conditions, Global Convergence of a Trust Region Algorithm for Nonlinear Inequality Constrained Optimization Problems, First and second order sensitivity analysis of nonlinear programs under directional constraint qualification conditions, Existence and boundedness of the Kuhn-Tucker multipliers in nonsmooth multiobjective optimization, On parametric nonlinear programming, Sensitivity analysis for variational inequalities and nonlinear complementarity problems, A new result on second-order necessary conditions for nonlinear programming, Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation, Geometry of optimality conditions and constraint qualifications: The convex case, On conditions to have bounded multipliers in locally lipschitz programming, An application of matrix computations to classical second-order optimality conditions, Shadow prices in nonconvex mathematical programming, A parametrized variational inequality approach to track the solution set of a generalized Nash equilibrium problem, Iterative bundle-based decomposition for large-scale nonseparable convex optimization, Strong stability of stationary solutions and Karush-Kuhn-Tucker points in nonlinear optimization, On an algorithm solving two-level programming problems with nonunique lower level solutions, On describing the solution sets of generalized Nash games with shared constraints, A robust sequential quadratic programming method, An SQP algorithm with cautious updating criteria for nonlinear degenerate problems, A global quadratic algorithm for solving a system of mixed equalities and inequalities, Karush-Kuhn-Tucker multiplier rules for efficient solutions of set-valued equilibrium problem with constraints, Optimality conditions in smooth nonlinear programming, On optimality conditions for generalized semi-infinite programming problems, The Lagrangian, constraint qualifications and economics, The boundedness of the Lagrange multipliers set and duality in mathematical programming, First-order optimality conditions in generalized semi-infinite programming, Computable numerical bounds for Lagrange multipliers of stationary points of nonconvex differentiable nonlinear programs, Constraint qualifications in nonsmooth multiobjective optimization, On uniqueness of Kuhn-Tucker multipliers in nonlinear programming, Pseudonormality and a Lagrange multiplier theory for constrained optimization, A globally convergent trust region algorithm for optimization with general constraints and simple bounds., Quadratic convergence of a primal-dual interior point method for degenerate nonlinear optimization problems, On constraint qualifications, Error bounds for generalized Lagrange multipliers in locally Lipschitz programming
Cites Work
