Exact penalty functions in nonlinear programming
From MaRDI portal
Publication:3859569
Cites work
- scientific article; zbMATH DE number 3727523 (Why is no real title available?)
- scientific article; zbMATH DE number 3257775 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- A globally convergent method for nonlinear programming
- A lower bound for the controlling parameters of the exact penalty functions
- An Exact Potential Method for Constrained Maxima
- Convex Analysis
- Exact Penalties for Local Minima
- Exact penalty functions in nonlinear programming
- Necessary and sufficient conditions for a penalty method to be exact
- New Conditions for Exactness of a Simple Penalty Function
- Non-Linear Programming Via Penalty Functions
- Note on Finite Convergence of Exterior Penalty Functions
- Second Order Conditions for Constrained Minima
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- The potential method for conditional maxima in the locally compact metric spaces
- Uniqueness of solution in linear programming
Cited in
(only showing first 100 items - show all)- An old problem and new tools
- Approach for multi-valued integer programming in multi-material topology optimization: random discrete steepest descent (RDSD) algorithm
- Exactness of the absolute value penalty function method for nonsmooth ‐invex optimization problems
- Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems
- Exact penalization of generalized Nash equilibrium problems
- A power penalty method for second-order cone nonlinear complementarity problems
- An inexact first-order method for constrained nonlinear optimization
- General duality in vector optimization
- The exact penalty principle
- A smoothing objective penalty function algorithm for inequality constrained optimization problems
- A local search method for optimization problem with d.c. inequality constraints
- Exact Lipschitz regularization of convex optimization problems
- Approximate optimality conditions and approximate duality conditions for robust multiobjective optimization problems
- Global optimality conditions and exact penalization
- Separating plane algorithms for convex optimization
- A competitive inexact nonmonotone filter SQP method: convergence analysis and numerical results
- New simple exact penalty function for constrained minimization
- Derivative-free approaches for chance-constrained problems with right-hand side uncertainty
- A subspace SQP method for equality constrained optimization
- Augmented Lagrangian Objective Penalty Function
- A least-distance programming procedure for minimization problems under linear constraints
- A globally convergent algorithm for exact penalty functions
- Vectorial penalisation in vector optimisation in real linear-topological spaces
- Restricted generalized Nash equilibria and controlled penalty algorithm
- A stable theorem of the alternative: An extension of the Gordan theorem
- A derivative-free algorithm for systems of nonlinear inequalities
- A unifying theory of exactness of linear penalty functions
- An approximation-based approach for chance-constrained vehicle routing and air traffic control problems
- Inexact sequential quadratic optimization with penalty parameter updates within the QP solver
- Transversality in variational analysis
- Exact penalty functions and Lagrange multipliers
- Steering exact penalty methods for nonlinear programming
- Pseudonormality and a Lagrange multiplier theory for constrained optimization
- Use of a finite penalty in convex programming problems for global convergence of Newton's method with steep adjustment
- An objective penalty function-based method for inequality constrained minimization problem
- Vector exponential penalty function method for nondifferentiable multiobjective programming problems
- Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
- Penalty functions in ε-programming and ε-minimax problems
- scientific article; zbMATH DE number 7399394 (Why is no real title available?)
- A power penalty method for second-order cone linear complementarity problems
- Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization
- The exactness property of the vector exact \(l_{1}\) penalty function method in nondifferentiable invex multiobjective programming
- A dual algorithm for minimax problems
- Duality and regularization for inf-sup problems
- New exact penalty functions for nonlinear constrained optimization problems
- Approximate solutions of multiobjective optimization problems
- Exact penalty function for nonlinear programming problems
- Lower bounds of controlling parameters of exact penalty functions in locally Lipschitz programming
- Nonlinear complementarity as unconstrained and constrained minimization
- Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
- On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems
- An approximate lower order penalty approach for solving second-order cone linear complementarity problems
- Sequential quadratic programming with a flexible step acceptance strategy
- A quadratic approximation method for minimizing a class of quasidifferentiable functions
- A robust sequential quadratic programming method
- Generalized lower-order penalty algorithm for solving second-order cone mixed complementarity problems
- A general system for heuristic minimization of convex functions over non-convex sets
- A Penalty Relaxation Method for Image Processing Using Euler's Elastica Model
- Penalty function methods and a duality gap for invex optimization problems
- Variations and extension of the convex-concave procedure
- Optimal switching control of message transmission in computer networks
- On the augmented subproblems within sequential methods for nonlinear programming
- Flattened aggregate function method for nonlinear programming with many complicated constraints
- On the exactness and the convergence of the \(l_1\) exact penalty \(E\)-function method for \(E\)-differentiable optimization problems
- Successive linearization methods for large-scale nonlinear programming problems
- A method for minimizing the sum of a convex function and a continuously differentiable function
- THE l1 PENALTY FUNCTION METHOD FOR NONCONVEX DIFFERENTIABLE OPTIMIZATION PROBLEMS WITH INEQUALITY CONSTRAINTS
- Minimum-support solutions of polyhedral concave programs*
- \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions
- Generalized second-order derivatives and optimality conditions
- Exact penalty functions and stability in locally Lipschitz programming
- Image space approach to penalty methods
- A sequential algorithm for solving nonlinear optimization problems with chance constraints
- An exact penalty function method with global convergence properties for nonlinear programming problems
- Space splitting convexification: a local solution method for nonconvex optimal control problems
- A lagrangian penalty function method for monotone variational inequalities
- A new exact exponential penalty function method and nonconvex mathematical programming
- Second-order conditions for an exact penalty function
- Exact penalty functions with multidimensional penalty parameter and adaptive penalty updates
- Multiextremal Optimization in Feasible Regions with Computable Boundaries on the Base of the Adaptive Nested Scheme
- Computing the nearest low-rank correlation matrix by a simplified SQP algorithm
- A line search exact penalty method using steering rules
- Exact penalty method with integrated consideration of the constraints
- Solving highly detailed gas transport MINLPs: block separability and penalty alternating direction methods
- An exact lower order penalty function and its smoothing in nonlinear programming
- The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems
- Exact barrier function methods for Lipschitz programs
- Identification of point sets by quasidifferentiable functions
- Linear programming with nonparametric penalty programs and iterated thresholding
- A dual differentiable exact penalty function
- Theorems of the alternative and optimality conditions
- Existence and stability of exact penalty for optimization problems with mixed constraints
- -optimality and duality for multiobjective fractional programming
- Smoothed penalty algorithms for optimization of nonlinear models
- Control of ellipsoidal trajectories: theory and numerical results
- Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization
- Second-order analysis of penalty function
- Optimality conditions in mathematical programming and composite optimization
- An algorithm for linearly constrained nonlinear programming problems
This page was built for publication: Exact penalty functions in nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3859569)
