Exact penalty functions in nonlinear programming

From MaRDI portal

Publication:3859569

Jump to:navigation, search

DOI10.1007/BF01588250zbMath0424.90057MaRDI QIDQ3859569

Olvi L. Mangasarian, Shih-Ping Han

Publication date: 1979

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

nonlinear programming local minima constraint qualification exact penalty functions second order optimality conditions Slater constraint qualification existence of global minima

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Related Items

Variations and extension of the convex-concave procedure, Existence of augmented Lagrange multipliers for semi-infinite programming problems, Exact penalty functions with multidimensional penalty parameter and adaptive penalty updates, Optimality conditions in mathematical programming and composite optimization, On the exactness of a class of nondifferentiable penalty functions, Exact penalties and sufficient conditions for optimality in nonsmooth optimization, Computing the nearest low-rank correlation matrix by a simplified SQP algorithm, Exact penalty functions and stability in locally Lipschitz programming, A Smoothing Objective Penalty Function Algorithm for Inequality Constrained Optimization Problems, Lower bounds of controlling parameters of exact penalty functions in locally Lipschitz programming, New simple exact penalty function for constrained minimization, Exact penalty results for mathematical programs with vanishing constraints, Exact barrier function methods for Lipschitz programs, Use of exact penalty functions to determine efficient decisions, Separating plane algorithms for convex optimization, An M-objective penalty function algorithm under big penalty parameters, Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization, Smooth exact penalty functions. II: A reduction to standard exact penalty functions, The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming, Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging, An approximate lower order penalty approach for solving second-order cone linear complementarity problems, Smoothed penalty algorithms for optimization of nonlinear models, Exactness and algorithm of an objective penalty function, On the smoothing of the square-root exact penalty function for inequality constrained optimization, Image space approach to penalty methods, On the augmented subproblems within sequential methods for nonlinear programming, A lagrangian penalty function method for monotone variational inequalities, Exact penalty method with integrated consideration of the constraints, Second-order analysis of penalty function, Transversality in variational analysis, Control of ellipsoidal trajectories: Theory and numerical results, A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization, Global optimality conditions and exact penalization, An exact penalty function method with global convergence properties for nonlinear programming problems, The exact \(G\)-penalty function method and \(G\)-invex mathematical programming problems, A globally convergent algorithm for exact penalty functions, The Exactness Property of the Vector Exact l₁ Penalty Function Method in Nondifferentiable Invex Multiobjective Programming, An algorithm for linearly constrained nonlinear programming problems, A new exact exponential penalty function method and nonconvex mathematical programming, A line search exact penalty method using steering rules, The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems, Unnamed Item, An estimation of exact penalty for infinite-dimensional inequality-constrained minimization problems, A new class of exact penalty functions and penalty algorithms, A stable theorem of the alternative: An extension of the Gordan theorem, Existence and stability of exact penalty for optimization problems with mixed constraints, Penalty function methods and a duality gap for invex optimization problems, An objective penalty function-based method for inequality constrained minimization problem, A least-distance programming procedure for minimization problems under linear constraints, Flattened aggregate function method for nonlinear programming with many complicated constraints, On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem, The exact penalty principle, Steering exact penalty methods for nonlinear programming, Application of the Armijo stepsize rule to the solution of a nonlinear system of equalities and inequalities, New exact penalty functions for nonlinear constrained optimization problems, Generalized lower-order penalty algorithm for solving second-order cone mixed complementarity problems, An Approximation-Based Approach for Chance-Constrained Vehicle Routing and Air Traffic Control Problems, On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems, Exact penalty function for nonlinear programming problems, Inexact Sequential Quadratic Optimization with Penalty Parameter Updates within the QP Solver, Existence of exact penalty for constrained optimization problems in metric spaces, A power penalty method for second-order cone nonlinear complementarity problems, A derivative-free algorithm for systems of nonlinear inequalities, Successive linearization methods for large-scale nonlinear programming problems, A novel hybrid PSO-based metaheuristic for costly portfolio selection problems, Vector exponential penalty function method for nondifferentiable multiobjective programming problems, A unified approach to the global exactness of penalty and augmented Lagrangian functions. I: Parametric exactness, Nonsmooth Optimization, \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions, General duality in vector optimization, Restricted generalized Nash equilibria and controlled penalty algorithm, A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization, Sequential quadratic programming with a flexible step acceptance strategy, An objective penalty function method for nonlinear programming., A penalty function method based on smoothing lower order penalty function, A dual algorithm for minimax problems, Use of a finite penalty in convex programming problems for global convergence of Newton's method with steep adjustment, A power penalty method for second-order cone linear complementarity problems, Augmented Lagrangian Objective Penalty Function, Exact penalty functions and Lagrange multipliers, THE l₁ PENALTY FUNCTION METHOD FOR NONCONVEX DIFFERENTIABLE OPTIMIZATION PROBLEMS WITH INEQUALITY CONSTRAINTS, Second-order conditions for an exact penalty function, Existence of exact penalty and its stability for nonconvex constrained optimization problems in Banach spaces, A local search method for optimization problem with d.c. inequality constraints, A unifying theory of exactness of linear penalty functions, \(\varepsilon\)-optimality and duality for multiobjective fractional programming, A globally convergent SQP method for semi-infinite nonlinear optimization, Duality and regularization for inf-sup problems, A robust sequential quadratic programming method, A subspace SQP method for equality constrained optimization, Theorems of the alternative and optimality conditions, A linear programming-based optimization algorithm for solving nonlinear programming problems, A method for minimizing the sum of a convex function and a continuously differentiable function, A quadratic approximation method for minimizing a class of quasidifferentiable functions, Pseudonormality and a Lagrange multiplier theory for constrained optimization, Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems, Finite perturbation of convex programs, Differential stability in non-Lipschitzian optimization, Nonlinear complementarity as unconstrained and constrained minimization, Approximate solutions of multiobjective optimization problems, Linear programming with nonparametric penalty programs and iterated thresholding, An inexact first-order method for constrained nonlinear optimization, Minimum-support solutions of polyhedral concave programs^*, A new kind of simple smooth exact penalty function of constrained nonlinear programming, A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results, An old problem and new tools, Identification of point sets by quasidifferentiable functions, Exact Penalization of Generalized Nash Equilibrium Problems, Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps, Generalized second-order derivatives and optimality conditions, On the exactness and the convergence of the \(l_1\) exact penalty \(E\)-function method for \(E\)-differentiable optimization problems, Exactness of the absolute value penalty function method for nonsmooth ‐invex optimization problems, Vectorial penalisation in vector optimisation in real linear-topological spaces, Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization, Space splitting convexification: a local solution method for nonconvex optimal control problems, Multiextremal Optimization in Feasible Regions with Computable Boundaries on the Base of the Adaptive Nested Scheme, Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies, Solving Highly Detailed Gas Transport MINLPs: Block Separability and Penalty Alternating Direction Methods, A Sequential Algorithm for Solving Nonlinear Optimization Problems with Chance Constraints, A general system for heuristic minimization of convex functions over non-convex sets, A polynomial approximation-based approach for chance-constrained optimization, Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems, An exact lower order penalty function and its smoothing in nonlinear programming, Unnamed Item, Optimization, Théorie de la pénalisation exacte, Sequential Quadratic Optimization for Nonlinear Equality Constrained Stochastic Optimization, Penalty functions in ε-programming and ε-minimax problems, A Penalty Relaxation Method for Image Processing Using Euler's Elastica Model, Sufficient Optimality Conditions in Bilevel Programming, A dual differentiable exact penalty function

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3859569&oldid=17473727"